./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/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 62062b34b4a23d127db54f6c179288673b97bcab ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/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 62062b34b4a23d127db54f6c179288673b97bcab ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:07:50,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:07:50,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:07:51,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:07:51,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:07:51,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:07:51,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:07:51,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:07:51,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:07:51,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:07:51,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:07:51,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:07:51,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:07:51,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:07:51,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:07:51,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:07:51,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:07:51,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:07:51,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:07:51,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:07:51,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:07:51,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:07:51,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:07:51,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:07:51,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:07:51,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:07:51,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:07:51,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:07:51,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:07:51,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:07:51,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:07:51,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:07:51,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:07:51,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:07:51,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:07:51,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:07:51,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:07:51,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:07:51,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:07:51,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:07:51,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:07:51,067 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:07:51,091 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:07:51,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:07:51,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:07:51,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:07:51,093 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:07:51,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:07:51,094 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:07:51,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:07:51,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:07:51,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:07:51,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:07:51,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:07:51,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:07:51,095 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:07:51,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:07:51,096 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:07:51,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:07:51,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:07:51,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:07:51,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:07:51,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:07:51,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:07:51,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:07:51,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:07:51,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:07:51,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:07:51,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:07:51,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:07:51,098 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_3e209bc0-4d70-4970-84a3-f636d2d0b50f/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 -> 62062b34b4a23d127db54f6c179288673b97bcab [2019-11-16 00:07:51,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:07:51,164 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:07:51,168 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:07:51,169 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:07:51,170 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:07:51,172 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c [2019-11-16 00:07:51,235 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/data/dba64b7a9/1c9be98b56224295b1789bd318983d2b/FLAG011803fe4 [2019-11-16 00:07:51,721 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:07:51,722 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c [2019-11-16 00:07:51,752 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/data/dba64b7a9/1c9be98b56224295b1789bd318983d2b/FLAG011803fe4 [2019-11-16 00:07:52,244 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/data/dba64b7a9/1c9be98b56224295b1789bd318983d2b [2019-11-16 00:07:52,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:07:52,247 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:07:52,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:07:52,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:07:52,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:07:52,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:07:52" (1/1) ... [2019-11-16 00:07:52,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7198fda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52, skipping insertion in model container [2019-11-16 00:07:52,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:07:52" (1/1) ... [2019-11-16 00:07:52,260 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:07:52,310 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:07:52,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:07:52,795 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:07:52,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:07:52,961 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:07:52,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52 WrapperNode [2019-11-16 00:07:52,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:07:52,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:07:52,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:07:52,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:07:52,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52" (1/1) ... [2019-11-16 00:07:53,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52" (1/1) ... [2019-11-16 00:07:53,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:07:53,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:07:53,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:07:53,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:07:53,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52" (1/1) ... [2019-11-16 00:07:53,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52" (1/1) ... [2019-11-16 00:07:53,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52" (1/1) ... [2019-11-16 00:07:53,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52" (1/1) ... [2019-11-16 00:07:53,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52" (1/1) ... [2019-11-16 00:07:53,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52" (1/1) ... [2019-11-16 00:07:53,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52" (1/1) ... [2019-11-16 00:07:53,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:07:53,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:07:53,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:07:53,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:07:53,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/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-11-16 00:07:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:07:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:07:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:07:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:07:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:07:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:07:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:07:53,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:07:53,591 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:07:54,495 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-16 00:07:54,496 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-16 00:07:54,497 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:07:54,497 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:07:54,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:07:54 BoogieIcfgContainer [2019-11-16 00:07:54,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:07:54,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:07:54,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:07:54,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:07:54,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:07:52" (1/3) ... [2019-11-16 00:07:54,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7eaf81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:07:54, skipping insertion in model container [2019-11-16 00:07:54,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:52" (2/3) ... [2019-11-16 00:07:54,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7eaf81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:07:54, skipping insertion in model container [2019-11-16 00:07:54,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:07:54" (3/3) ... [2019-11-16 00:07:54,507 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-2.c [2019-11-16 00:07:54,517 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:07:54,525 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:07:54,536 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:07:54,564 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:07:54,564 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:07:54,565 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:07:54,565 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:07:54,565 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:07:54,565 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:07:54,565 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:07:54,566 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:07:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-16 00:07:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:07:54,604 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:54,604 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:54,607 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:54,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:54,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-11-16 00:07:54,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:54,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489461315] [2019-11-16 00:07:54,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:54,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:54,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:54,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489461315] [2019-11-16 00:07:54,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:54,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:54,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347933071] [2019-11-16 00:07:54,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:54,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:55,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:55,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:55,011 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-16 00:07:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:55,546 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-16 00:07:55,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:55,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-16 00:07:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:55,560 INFO L225 Difference]: With dead ends: 323 [2019-11-16 00:07:55,561 INFO L226 Difference]: Without dead ends: 163 [2019-11-16 00:07:55,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:07:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-16 00:07:55,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-16 00:07:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:07:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-16 00:07:55,623 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-16 00:07:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:55,624 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-16 00:07:55,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-16 00:07:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:07:55,628 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:55,628 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:55,629 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:55,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2019-11-16 00:07:55,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:55,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918157650] [2019-11-16 00:07:55,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:55,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:55,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:55,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918157650] [2019-11-16 00:07:55,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:55,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:55,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538804382] [2019-11-16 00:07:55,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:55,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:55,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:55,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:55,786 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-16 00:07:56,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:56,173 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-16 00:07:56,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:56,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-16 00:07:56,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:56,176 INFO L225 Difference]: With dead ends: 290 [2019-11-16 00:07:56,176 INFO L226 Difference]: Without dead ends: 163 [2019-11-16 00:07:56,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:07:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-16 00:07:56,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-16 00:07:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:07:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-16 00:07:56,199 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-16 00:07:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:56,200 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-16 00:07:56,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-16 00:07:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:07:56,206 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:56,206 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:56,207 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:56,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2019-11-16 00:07:56,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:56,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938938966] [2019-11-16 00:07:56,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:56,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:56,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:56,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938938966] [2019-11-16 00:07:56,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:56,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:56,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681727666] [2019-11-16 00:07:56,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:56,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:56,327 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-16 00:07:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:56,688 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-16 00:07:56,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:56,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-16 00:07:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:56,691 INFO L225 Difference]: With dead ends: 289 [2019-11-16 00:07:56,692 INFO L226 Difference]: Without dead ends: 162 [2019-11-16 00:07:56,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:07:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-16 00:07:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-16 00:07:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:07:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-16 00:07:56,711 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-16 00:07:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:56,711 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-16 00:07:56,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-16 00:07:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:07:56,717 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:56,717 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:56,717 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:56,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2019-11-16 00:07:56,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:56,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635186310] [2019-11-16 00:07:56,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:56,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:56,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:56,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635186310] [2019-11-16 00:07:56,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:56,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:56,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15658439] [2019-11-16 00:07:56,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:56,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:56,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:56,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:56,815 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-16 00:07:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:57,210 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-16 00:07:57,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:57,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-16 00:07:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:57,212 INFO L225 Difference]: With dead ends: 287 [2019-11-16 00:07:57,212 INFO L226 Difference]: Without dead ends: 160 [2019-11-16 00:07:57,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:07:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-16 00:07:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-16 00:07:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:07:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-16 00:07:57,225 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-16 00:07:57,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:57,226 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-16 00:07:57,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-16 00:07:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:07:57,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:57,228 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:57,228 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:57,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2019-11-16 00:07:57,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:57,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627889453] [2019-11-16 00:07:57,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:57,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:57,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:57,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627889453] [2019-11-16 00:07:57,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:57,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:57,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220260884] [2019-11-16 00:07:57,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:57,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:57,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:57,328 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-16 00:07:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:57,701 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-16 00:07:57,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:57,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-16 00:07:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:57,704 INFO L225 Difference]: With dead ends: 286 [2019-11-16 00:07:57,704 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:07:57,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:07:57,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:07:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-16 00:07:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:07:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-16 00:07:57,713 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-16 00:07:57,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:57,718 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-16 00:07:57,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-16 00:07:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:07:57,721 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:57,721 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:57,721 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:57,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:57,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2019-11-16 00:07:57,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:57,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319709159] [2019-11-16 00:07:57,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:57,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:57,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:57,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319709159] [2019-11-16 00:07:57,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:57,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:57,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210282276] [2019-11-16 00:07:57,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:57,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:57,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:57,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:57,828 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-16 00:07:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:58,206 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-16 00:07:58,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:58,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-16 00:07:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:58,208 INFO L225 Difference]: With dead ends: 286 [2019-11-16 00:07:58,208 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:07:58,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:07:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:07:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-16 00:07:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:07:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-16 00:07:58,218 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-16 00:07:58,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:58,218 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-16 00:07:58,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-16 00:07:58,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:07:58,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:58,220 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:58,220 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:58,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:58,220 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2019-11-16 00:07:58,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:58,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467461845] [2019-11-16 00:07:58,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:58,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:58,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:58,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:58,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467461845] [2019-11-16 00:07:58,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:58,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:58,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557885753] [2019-11-16 00:07:58,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:58,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:58,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:58,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:58,277 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-16 00:07:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:58,611 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-16 00:07:58,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:58,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-16 00:07:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:58,614 INFO L225 Difference]: With dead ends: 286 [2019-11-16 00:07:58,614 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:07:58,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:07:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:07:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-16 00:07:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:07:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-16 00:07:58,622 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-16 00:07:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:58,622 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-16 00:07:58,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-16 00:07:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:07:58,623 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:58,624 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:58,624 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:58,624 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2019-11-16 00:07:58,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:58,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579638226] [2019-11-16 00:07:58,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:58,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:58,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:58,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579638226] [2019-11-16 00:07:58,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:58,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:58,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833651647] [2019-11-16 00:07:58,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:58,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:58,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:58,683 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-16 00:07:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:59,054 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-16 00:07:59,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:59,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-16 00:07:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:59,056 INFO L225 Difference]: With dead ends: 286 [2019-11-16 00:07:59,056 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:07:59,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:07:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:07:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-16 00:07:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:07:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-16 00:07:59,062 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-16 00:07:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:59,062 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-16 00:07:59,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-16 00:07:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:07:59,063 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:59,063 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:59,063 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:59,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:59,064 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2019-11-16 00:07:59,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:59,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288399948] [2019-11-16 00:07:59,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:59,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288399948] [2019-11-16 00:07:59,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:59,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:59,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112702810] [2019-11-16 00:07:59,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:59,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:59,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:59,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:59,170 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-16 00:07:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:59,438 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-16 00:07:59,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:59,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-16 00:07:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:59,440 INFO L225 Difference]: With dead ends: 276 [2019-11-16 00:07:59,440 INFO L226 Difference]: Without dead ends: 149 [2019-11-16 00:07:59,441 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:07:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-16 00:07:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-16 00:07:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:07:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-16 00:07:59,445 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-16 00:07:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:59,446 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-16 00:07:59,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-16 00:07:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:07:59,446 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:59,447 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:59,447 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:59,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:59,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2019-11-16 00:07:59,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:59,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831417704] [2019-11-16 00:07:59,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:59,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831417704] [2019-11-16 00:07:59,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:59,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:59,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535999972] [2019-11-16 00:07:59,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:59,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:59,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:59,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:59,552 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-16 00:07:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:59,918 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-16 00:07:59,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:59,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-16 00:07:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:59,920 INFO L225 Difference]: With dead ends: 316 [2019-11-16 00:07:59,920 INFO L226 Difference]: Without dead ends: 189 [2019-11-16 00:07:59,921 INFO L600 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-11-16 00:07:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-16 00:07:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-16 00:07:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:07:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-16 00:07:59,926 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-16 00:07:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:59,927 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-16 00:07:59,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-16 00:07:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:07:59,928 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:59,928 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:59,928 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:59,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2019-11-16 00:07:59,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:59,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361436256] [2019-11-16 00:07:59,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:59,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361436256] [2019-11-16 00:07:59,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:59,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:59,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391398357] [2019-11-16 00:07:59,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:59,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:59,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:59,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:59,989 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-16 00:08:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:00,360 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-16 00:08:00,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:00,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-16 00:08:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:00,362 INFO L225 Difference]: With dead ends: 338 [2019-11-16 00:08:00,362 INFO L226 Difference]: Without dead ends: 189 [2019-11-16 00:08:00,363 INFO L600 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-11-16 00:08:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-16 00:08:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-16 00:08:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:08:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-16 00:08:00,368 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-16 00:08:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:00,369 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-16 00:08:00,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-16 00:08:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:08:00,371 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:00,371 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:00,371 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:00,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:00,372 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2019-11-16 00:08:00,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:00,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133882570] [2019-11-16 00:08:00,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:00,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:00,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:00,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133882570] [2019-11-16 00:08:00,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:00,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:00,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864589608] [2019-11-16 00:08:00,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:00,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:00,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:00,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:00,438 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-16 00:08:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:00,807 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-16 00:08:00,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:00,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:08:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:00,810 INFO L225 Difference]: With dead ends: 337 [2019-11-16 00:08:00,810 INFO L226 Difference]: Without dead ends: 188 [2019-11-16 00:08:00,810 INFO L600 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-11-16 00:08:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-16 00:08:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-16 00:08:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:08:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-16 00:08:00,816 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-16 00:08:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:00,817 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-16 00:08:00,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-16 00:08:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:08:00,818 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:00,818 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:00,818 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:00,819 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2019-11-16 00:08:00,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:00,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000767107] [2019-11-16 00:08:00,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:00,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:00,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:00,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000767107] [2019-11-16 00:08:00,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:00,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:00,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211634933] [2019-11-16 00:08:00,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:00,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:00,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:00,864 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-16 00:08:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:01,245 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-16 00:08:01,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:01,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:08:01,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:01,247 INFO L225 Difference]: With dead ends: 335 [2019-11-16 00:08:01,248 INFO L226 Difference]: Without dead ends: 186 [2019-11-16 00:08:01,248 INFO L600 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-11-16 00:08:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-16 00:08:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-16 00:08:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:08:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-16 00:08:01,254 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-16 00:08:01,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:01,254 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-16 00:08:01,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-16 00:08:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:08:01,255 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:01,255 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:01,256 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:01,256 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2019-11-16 00:08:01,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:01,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809222413] [2019-11-16 00:08:01,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:01,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:01,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:01,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809222413] [2019-11-16 00:08:01,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:01,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:01,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997217625] [2019-11-16 00:08:01,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:01,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:01,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:01,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:01,320 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-16 00:08:01,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:01,675 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-16 00:08:01,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:01,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:08:01,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:01,677 INFO L225 Difference]: With dead ends: 334 [2019-11-16 00:08:01,677 INFO L226 Difference]: Without dead ends: 185 [2019-11-16 00:08:01,678 INFO L600 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-11-16 00:08:01,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-16 00:08:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-16 00:08:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:08:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-16 00:08:01,683 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-16 00:08:01,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:01,684 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-16 00:08:01,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-16 00:08:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:08:01,684 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:01,685 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:01,685 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:01,686 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2019-11-16 00:08:01,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:01,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009138389] [2019-11-16 00:08:01,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:01,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:01,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:01,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009138389] [2019-11-16 00:08:01,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:01,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:01,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101752475] [2019-11-16 00:08:01,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:01,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:01,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:01,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:01,764 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-16 00:08:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:02,129 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-16 00:08:02,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:02,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:08:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:02,131 INFO L225 Difference]: With dead ends: 334 [2019-11-16 00:08:02,131 INFO L226 Difference]: Without dead ends: 185 [2019-11-16 00:08:02,132 INFO L600 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-11-16 00:08:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-16 00:08:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-16 00:08:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:08:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-16 00:08:02,142 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-16 00:08:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:02,142 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-16 00:08:02,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-16 00:08:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:08:02,143 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:02,144 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:02,144 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:02,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2019-11-16 00:08:02,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:02,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333424547] [2019-11-16 00:08:02,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:02,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:02,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:02,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333424547] [2019-11-16 00:08:02,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:02,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:02,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149723132] [2019-11-16 00:08:02,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:02,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:02,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:02,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:02,201 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-16 00:08:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:02,593 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-16 00:08:02,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:02,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-16 00:08:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:02,595 INFO L225 Difference]: With dead ends: 334 [2019-11-16 00:08:02,595 INFO L226 Difference]: Without dead ends: 185 [2019-11-16 00:08:02,595 INFO L600 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-11-16 00:08:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-16 00:08:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-16 00:08:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:08:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-16 00:08:02,601 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-16 00:08:02,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:02,602 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-16 00:08:02,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:02,602 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-16 00:08:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:08:02,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:02,603 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:02,603 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:02,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:02,604 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2019-11-16 00:08:02,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:02,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861868053] [2019-11-16 00:08:02,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:02,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:02,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:02,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861868053] [2019-11-16 00:08:02,659 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:02,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:02,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585686771] [2019-11-16 00:08:02,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:02,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:02,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:02,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:02,660 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-16 00:08:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:02,954 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-16 00:08:02,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:02,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-16 00:08:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:02,956 INFO L225 Difference]: With dead ends: 334 [2019-11-16 00:08:02,957 INFO L226 Difference]: Without dead ends: 185 [2019-11-16 00:08:02,957 INFO L600 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-11-16 00:08:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-16 00:08:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-16 00:08:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:08:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-16 00:08:02,963 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-16 00:08:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:02,964 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-16 00:08:02,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-16 00:08:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:08:02,965 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:02,965 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:02,965 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:02,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:02,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2019-11-16 00:08:02,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:02,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104961314] [2019-11-16 00:08:02,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:02,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:02,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:03,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104961314] [2019-11-16 00:08:03,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:03,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:03,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598563905] [2019-11-16 00:08:03,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:03,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:03,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:03,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:03,018 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-16 00:08:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:03,303 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-16 00:08:03,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:03,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-16 00:08:03,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:03,305 INFO L225 Difference]: With dead ends: 324 [2019-11-16 00:08:03,305 INFO L226 Difference]: Without dead ends: 175 [2019-11-16 00:08:03,306 INFO L600 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-11-16 00:08:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-16 00:08:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-16 00:08:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:08:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-16 00:08:03,311 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-16 00:08:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:03,311 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-16 00:08:03,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-16 00:08:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:08:03,312 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:03,312 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:03,313 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:03,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2019-11-16 00:08:03,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:03,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701671388] [2019-11-16 00:08:03,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:03,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:03,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:03,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701671388] [2019-11-16 00:08:03,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:03,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:03,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998311689] [2019-11-16 00:08:03,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:03,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:03,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:03,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:03,410 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-16 00:08:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:03,879 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-11-16 00:08:03,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:03,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-16 00:08:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:03,881 INFO L225 Difference]: With dead ends: 424 [2019-11-16 00:08:03,881 INFO L226 Difference]: Without dead ends: 275 [2019-11-16 00:08:03,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-16 00:08:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-11-16 00:08:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-16 00:08:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-16 00:08:03,890 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-16 00:08:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:03,890 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-16 00:08:03,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-16 00:08:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:08:03,891 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:03,891 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:03,892 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:03,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:03,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2019-11-16 00:08:03,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:03,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228685672] [2019-11-16 00:08:03,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:03,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:03,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:03,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228685672] [2019-11-16 00:08:03,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:03,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:03,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984877868] [2019-11-16 00:08:03,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:03,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:03,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:03,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:03,949 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-16 00:08:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:04,344 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-16 00:08:04,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:04,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-16 00:08:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:04,346 INFO L225 Difference]: With dead ends: 427 [2019-11-16 00:08:04,346 INFO L226 Difference]: Without dead ends: 248 [2019-11-16 00:08:04,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-16 00:08:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-16 00:08:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-16 00:08:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-16 00:08:04,354 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-16 00:08:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:04,355 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-16 00:08:04,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-16 00:08:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:08:04,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:04,356 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:04,357 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2019-11-16 00:08:04,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:04,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878510577] [2019-11-16 00:08:04,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:04,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:04,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:04,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878510577] [2019-11-16 00:08:04,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:04,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:04,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379740732] [2019-11-16 00:08:04,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:04,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:04,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:04,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:04,429 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-16 00:08:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:04,880 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-11-16 00:08:04,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:04,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-16 00:08:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:04,883 INFO L225 Difference]: With dead ends: 494 [2019-11-16 00:08:04,883 INFO L226 Difference]: Without dead ends: 291 [2019-11-16 00:08:04,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-16 00:08:04,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-11-16 00:08:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-16 00:08:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-16 00:08:04,891 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-16 00:08:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:04,891 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-16 00:08:04,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-16 00:08:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:08:04,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:04,893 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:04,893 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:04,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:04,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2019-11-16 00:08:04,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:04,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580859137] [2019-11-16 00:08:04,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:04,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:04,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:04,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580859137] [2019-11-16 00:08:04,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:04,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:04,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616212325] [2019-11-16 00:08:04,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:04,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:04,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:04,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:04,965 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-16 00:08:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:05,347 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-11-16 00:08:05,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:05,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-16 00:08:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:05,351 INFO L225 Difference]: With dead ends: 495 [2019-11-16 00:08:05,351 INFO L226 Difference]: Without dead ends: 291 [2019-11-16 00:08:05,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-16 00:08:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-11-16 00:08:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-16 00:08:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-16 00:08:05,360 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-11-16 00:08:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:05,361 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-16 00:08:05,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-16 00:08:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:08:05,362 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:05,362 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:05,363 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:05,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:05,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2019-11-16 00:08:05,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:05,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50372991] [2019-11-16 00:08:05,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:05,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:05,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:05,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50372991] [2019-11-16 00:08:05,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:05,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:05,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508347859] [2019-11-16 00:08:05,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:05,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:05,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:05,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:05,444 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-16 00:08:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:05,786 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2019-11-16 00:08:05,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:05,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-16 00:08:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:05,792 INFO L225 Difference]: With dead ends: 499 [2019-11-16 00:08:05,792 INFO L226 Difference]: Without dead ends: 285 [2019-11-16 00:08:05,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-16 00:08:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-16 00:08:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:08:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-16 00:08:05,799 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-11-16 00:08:05,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:05,800 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-16 00:08:05,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-16 00:08:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:08:05,801 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:05,801 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:05,801 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:05,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:05,802 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2019-11-16 00:08:05,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:05,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799238592] [2019-11-16 00:08:05,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:05,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:05,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:05,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799238592] [2019-11-16 00:08:05,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:05,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:05,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288009486] [2019-11-16 00:08:05,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:05,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:05,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:05,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:05,905 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-16 00:08:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:06,397 INFO L93 Difference]: Finished difference Result 500 states and 772 transitions. [2019-11-16 00:08:06,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:06,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-16 00:08:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:06,399 INFO L225 Difference]: With dead ends: 500 [2019-11-16 00:08:06,399 INFO L226 Difference]: Without dead ends: 285 [2019-11-16 00:08:06,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-16 00:08:06,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-16 00:08:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:08:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-16 00:08:06,406 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-16 00:08:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:06,406 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-16 00:08:06,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-16 00:08:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:08:06,407 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:06,408 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:06,408 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2019-11-16 00:08:06,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:06,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726074265] [2019-11-16 00:08:06,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:06,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:06,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:06,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726074265] [2019-11-16 00:08:06,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:06,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:06,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710098004] [2019-11-16 00:08:06,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:06,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:06,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:06,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:06,483 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-16 00:08:06,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:06,814 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-16 00:08:06,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:06,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-16 00:08:06,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:06,816 INFO L225 Difference]: With dead ends: 475 [2019-11-16 00:08:06,817 INFO L226 Difference]: Without dead ends: 260 [2019-11-16 00:08:06,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-16 00:08:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-16 00:08:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:08:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-16 00:08:06,823 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-16 00:08:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:06,824 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-16 00:08:06,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-16 00:08:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:08:06,824 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:06,825 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:06,825 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2019-11-16 00:08:06,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:06,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864903386] [2019-11-16 00:08:06,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:06,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:06,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:06,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864903386] [2019-11-16 00:08:06,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:06,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:06,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850022971] [2019-11-16 00:08:06,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:06,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:06,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:06,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:06,900 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-16 00:08:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:07,410 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2019-11-16 00:08:07,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:07,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:08:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:07,412 INFO L225 Difference]: With dead ends: 499 [2019-11-16 00:08:07,412 INFO L226 Difference]: Without dead ends: 284 [2019-11-16 00:08:07,412 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-16 00:08:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 234. [2019-11-16 00:08:07,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:08:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-16 00:08:07,417 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-16 00:08:07,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:07,417 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-16 00:08:07,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-16 00:08:07,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:08:07,418 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:07,419 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:07,419 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:07,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:07,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2019-11-16 00:08:07,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:07,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213845852] [2019-11-16 00:08:07,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:07,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:07,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:07,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213845852] [2019-11-16 00:08:07,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:07,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:07,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824697474] [2019-11-16 00:08:07,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:07,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:07,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:07,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:07,480 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-16 00:08:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:07,966 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-16 00:08:07,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:07,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:08:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:07,969 INFO L225 Difference]: With dead ends: 497 [2019-11-16 00:08:07,969 INFO L226 Difference]: Without dead ends: 282 [2019-11-16 00:08:07,970 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:07,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-16 00:08:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-16 00:08:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:08:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-16 00:08:07,975 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-16 00:08:07,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:07,976 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-16 00:08:07,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-16 00:08:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:08:07,977 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:07,977 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:07,977 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:07,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:07,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2019-11-16 00:08:07,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:07,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623971825] [2019-11-16 00:08:07,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:07,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:07,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:08,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623971825] [2019-11-16 00:08:08,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:08,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:08,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515489464] [2019-11-16 00:08:08,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:08,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:08,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:08,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:08,050 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-16 00:08:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:08,602 INFO L93 Difference]: Finished difference Result 496 states and 760 transitions. [2019-11-16 00:08:08,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:08,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:08:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:08,604 INFO L225 Difference]: With dead ends: 496 [2019-11-16 00:08:08,605 INFO L226 Difference]: Without dead ends: 281 [2019-11-16 00:08:08,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-16 00:08:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2019-11-16 00:08:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:08:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-16 00:08:08,612 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-16 00:08:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:08,612 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-16 00:08:08,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-16 00:08:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:08:08,614 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:08,614 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:08,614 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:08,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2019-11-16 00:08:08,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:08,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684339635] [2019-11-16 00:08:08,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:08,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:08,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:08:08,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684339635] [2019-11-16 00:08:08,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:08,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:08:08,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889267554] [2019-11-16 00:08:08,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:08:08,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:08,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:08:08,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:08:08,705 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-16 00:08:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:09,298 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-16 00:08:09,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:08:09,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-16 00:08:09,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:09,301 INFO L225 Difference]: With dead ends: 470 [2019-11-16 00:08:09,301 INFO L226 Difference]: Without dead ends: 255 [2019-11-16 00:08:09,301 INFO L600 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-11-16 00:08:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-16 00:08:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-16 00:08:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:08:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-16 00:08:09,310 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-16 00:08:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:09,310 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-16 00:08:09,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:08:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-16 00:08:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:08:09,312 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:09,312 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:09,312 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:09,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:09,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2019-11-16 00:08:09,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:09,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50473644] [2019-11-16 00:08:09,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:09,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:09,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:09,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50473644] [2019-11-16 00:08:09,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:09,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:09,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906348657] [2019-11-16 00:08:09,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:09,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:09,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:09,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:09,375 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-16 00:08:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:09,754 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-16 00:08:09,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:09,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:08:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:09,756 INFO L225 Difference]: With dead ends: 512 [2019-11-16 00:08:09,756 INFO L226 Difference]: Without dead ends: 277 [2019-11-16 00:08:09,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-16 00:08:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-16 00:08:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:08:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-16 00:08:09,765 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-16 00:08:09,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:09,765 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-16 00:08:09,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-16 00:08:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:08:09,767 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:09,767 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:09,767 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:09,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2019-11-16 00:08:09,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:09,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109172498] [2019-11-16 00:08:09,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:09,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:09,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:09,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109172498] [2019-11-16 00:08:09,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:09,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:09,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033057610] [2019-11-16 00:08:09,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:09,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:09,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:09,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:09,829 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-16 00:08:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:10,102 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-16 00:08:10,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:10,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:08:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:10,104 INFO L225 Difference]: With dead ends: 511 [2019-11-16 00:08:10,104 INFO L226 Difference]: Without dead ends: 276 [2019-11-16 00:08:10,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-16 00:08:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-16 00:08:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:08:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-16 00:08:10,111 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-16 00:08:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:10,111 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-16 00:08:10,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-16 00:08:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:08:10,112 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:10,113 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:10,113 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:10,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2019-11-16 00:08:10,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:10,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222578144] [2019-11-16 00:08:10,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:10,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:10,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:10,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222578144] [2019-11-16 00:08:10,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:10,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:10,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920653987] [2019-11-16 00:08:10,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:10,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:10,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:10,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:10,200 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-16 00:08:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:10,629 INFO L93 Difference]: Finished difference Result 536 states and 805 transitions. [2019-11-16 00:08:10,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:10,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-16 00:08:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:10,632 INFO L225 Difference]: With dead ends: 536 [2019-11-16 00:08:10,632 INFO L226 Difference]: Without dead ends: 301 [2019-11-16 00:08:10,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-16 00:08:10,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-16 00:08:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:08:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-16 00:08:10,642 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-16 00:08:10,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:10,642 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-16 00:08:10,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-16 00:08:10,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:08:10,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:10,644 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:10,644 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:10,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:10,644 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2019-11-16 00:08:10,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:10,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159721204] [2019-11-16 00:08:10,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:10,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:10,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:10,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159721204] [2019-11-16 00:08:10,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:10,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:10,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570327617] [2019-11-16 00:08:10,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:10,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:10,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:10,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:10,699 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-16 00:08:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:11,048 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-16 00:08:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:11,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-16 00:08:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:11,050 INFO L225 Difference]: With dead ends: 511 [2019-11-16 00:08:11,051 INFO L226 Difference]: Without dead ends: 276 [2019-11-16 00:08:11,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-16 00:08:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-16 00:08:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:08:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-16 00:08:11,059 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-16 00:08:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:11,059 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-16 00:08:11,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-16 00:08:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-16 00:08:11,061 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:11,061 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:11,061 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:11,062 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2019-11-16 00:08:11,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:11,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585698478] [2019-11-16 00:08:11,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:11,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:11,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:11,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585698478] [2019-11-16 00:08:11,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:11,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:11,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958579522] [2019-11-16 00:08:11,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:11,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:11,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:11,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:11,140 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-16 00:08:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:11,555 INFO L93 Difference]: Finished difference Result 536 states and 801 transitions. [2019-11-16 00:08:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:11,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-16 00:08:11,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:11,557 INFO L225 Difference]: With dead ends: 536 [2019-11-16 00:08:11,557 INFO L226 Difference]: Without dead ends: 301 [2019-11-16 00:08:11,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-16 00:08:11,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-16 00:08:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:08:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-16 00:08:11,565 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-16 00:08:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:11,566 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-16 00:08:11,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-16 00:08:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-16 00:08:11,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:11,567 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:11,568 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2019-11-16 00:08:11,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:11,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476049421] [2019-11-16 00:08:11,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:11,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:11,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:11,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476049421] [2019-11-16 00:08:11,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:11,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:11,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706839078] [2019-11-16 00:08:11,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:11,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:11,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:11,641 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-16 00:08:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:11,975 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-16 00:08:11,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:11,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-16 00:08:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:11,977 INFO L225 Difference]: With dead ends: 511 [2019-11-16 00:08:11,978 INFO L226 Difference]: Without dead ends: 276 [2019-11-16 00:08:11,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-16 00:08:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-16 00:08:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:08:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-16 00:08:11,985 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-16 00:08:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:11,985 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-16 00:08:11,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-16 00:08:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:08:11,986 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:11,987 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:11,987 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2019-11-16 00:08:11,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:11,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190678585] [2019-11-16 00:08:11,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:11,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:11,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:12,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190678585] [2019-11-16 00:08:12,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:12,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:12,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684525030] [2019-11-16 00:08:12,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:12,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:12,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:12,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:12,039 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-16 00:08:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:12,462 INFO L93 Difference]: Finished difference Result 536 states and 797 transitions. [2019-11-16 00:08:12,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:12,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-16 00:08:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:12,465 INFO L225 Difference]: With dead ends: 536 [2019-11-16 00:08:12,465 INFO L226 Difference]: Without dead ends: 301 [2019-11-16 00:08:12,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-16 00:08:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-16 00:08:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:08:12,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-16 00:08:12,475 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-16 00:08:12,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:12,475 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-16 00:08:12,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-16 00:08:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:08:12,477 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:12,477 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:12,477 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:12,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:12,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2019-11-16 00:08:12,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:12,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087866966] [2019-11-16 00:08:12,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:12,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:12,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:12,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087866966] [2019-11-16 00:08:12,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:12,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:12,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980325706] [2019-11-16 00:08:12,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:12,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:12,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:12,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:12,565 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-16 00:08:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:12,966 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-16 00:08:12,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:12,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-16 00:08:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:12,968 INFO L225 Difference]: With dead ends: 511 [2019-11-16 00:08:12,968 INFO L226 Difference]: Without dead ends: 276 [2019-11-16 00:08:12,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-16 00:08:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-16 00:08:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:08:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-16 00:08:12,977 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-16 00:08:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:12,977 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-16 00:08:12,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-16 00:08:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-16 00:08:12,978 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:12,979 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:12,979 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:12,979 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2019-11-16 00:08:12,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:12,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091119590] [2019-11-16 00:08:12,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:12,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:12,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:13,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091119590] [2019-11-16 00:08:13,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:13,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:13,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800000824] [2019-11-16 00:08:13,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:13,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:13,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:13,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:13,069 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-16 00:08:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:13,480 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2019-11-16 00:08:13,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:13,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-16 00:08:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:13,482 INFO L225 Difference]: With dead ends: 526 [2019-11-16 00:08:13,483 INFO L226 Difference]: Without dead ends: 291 [2019-11-16 00:08:13,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-16 00:08:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-16 00:08:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:08:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-16 00:08:13,492 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-16 00:08:13,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:13,493 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-16 00:08:13,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-16 00:08:13,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-16 00:08:13,494 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:13,495 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:13,495 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:13,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:13,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2019-11-16 00:08:13,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:13,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206328123] [2019-11-16 00:08:13,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:13,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:13,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:13,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206328123] [2019-11-16 00:08:13,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:13,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:13,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600790974] [2019-11-16 00:08:13,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:13,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:13,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:13,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:13,617 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-16 00:08:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:13,932 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-16 00:08:13,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:13,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-16 00:08:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:13,934 INFO L225 Difference]: With dead ends: 501 [2019-11-16 00:08:13,934 INFO L226 Difference]: Without dead ends: 266 [2019-11-16 00:08:13,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-16 00:08:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-16 00:08:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:08:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-16 00:08:13,943 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-16 00:08:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:13,944 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-16 00:08:13,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-16 00:08:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:08:13,945 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:13,945 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:13,945 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:13,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2019-11-16 00:08:13,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:13,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186400479] [2019-11-16 00:08:13,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:13,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:13,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:08:14,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186400479] [2019-11-16 00:08:14,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:14,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:14,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634890032] [2019-11-16 00:08:14,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:14,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:14,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:14,003 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-16 00:08:14,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:14,462 INFO L93 Difference]: Finished difference Result 526 states and 777 transitions. [2019-11-16 00:08:14,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:14,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-16 00:08:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:14,464 INFO L225 Difference]: With dead ends: 526 [2019-11-16 00:08:14,465 INFO L226 Difference]: Without dead ends: 291 [2019-11-16 00:08:14,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-16 00:08:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-16 00:08:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-16 00:08:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:08:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-16 00:08:14,474 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-16 00:08:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:14,474 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-16 00:08:14,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-16 00:08:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:08:14,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:14,476 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:14,476 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:14,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2019-11-16 00:08:14,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:14,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277393162] [2019-11-16 00:08:14,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:14,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:14,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-16 00:08:14,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277393162] [2019-11-16 00:08:14,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:14,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:14,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421795652] [2019-11-16 00:08:14,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:14,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:14,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:14,535 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-16 00:08:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:14,591 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-16 00:08:14,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:14,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-16 00:08:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:14,594 INFO L225 Difference]: With dead ends: 722 [2019-11-16 00:08:14,594 INFO L226 Difference]: Without dead ends: 487 [2019-11-16 00:08:14,594 INFO L600 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-11-16 00:08:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-16 00:08:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-16 00:08:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-16 00:08:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-16 00:08:14,620 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-16 00:08:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:14,621 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-16 00:08:14,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:14,621 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-16 00:08:14,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:08:14,622 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:14,623 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:14,623 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:14,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:14,623 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2019-11-16 00:08:14,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:14,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402764681] [2019-11-16 00:08:14,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:14,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:14,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:08:14,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402764681] [2019-11-16 00:08:14,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:14,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:14,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221998115] [2019-11-16 00:08:14,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:14,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:14,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:14,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:14,676 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-16 00:08:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:14,735 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-16 00:08:14,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:14,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-16 00:08:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:14,740 INFO L225 Difference]: With dead ends: 1190 [2019-11-16 00:08:14,740 INFO L226 Difference]: Without dead ends: 722 [2019-11-16 00:08:14,741 INFO L600 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-11-16 00:08:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-16 00:08:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-16 00:08:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-16 00:08:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-16 00:08:14,760 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-16 00:08:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:14,761 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-16 00:08:14,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-16 00:08:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-16 00:08:14,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:14,763 INFO L380 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-11-16 00:08:14,763 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:14,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:14,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2019-11-16 00:08:14,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:14,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962543458] [2019-11-16 00:08:14,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:14,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:14,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:08:14,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962543458] [2019-11-16 00:08:14,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:14,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:14,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389212599] [2019-11-16 00:08:14,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:14,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:14,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:14,820 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-16 00:08:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:14,900 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-16 00:08:14,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:14,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-16 00:08:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:14,906 INFO L225 Difference]: With dead ends: 1656 [2019-11-16 00:08:14,906 INFO L226 Difference]: Without dead ends: 955 [2019-11-16 00:08:14,908 INFO L600 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-11-16 00:08:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-16 00:08:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-16 00:08:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-16 00:08:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-16 00:08:14,936 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-11-16 00:08:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:14,938 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-16 00:08:14,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-16 00:08:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-16 00:08:14,940 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:14,940 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:14,941 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:14,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:14,941 INFO L82 PathProgramCache]: Analyzing trace with hash -796142130, now seen corresponding path program 1 times [2019-11-16 00:08:14,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:14,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426955585] [2019-11-16 00:08:14,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:14,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:14,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:08:15,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426955585] [2019-11-16 00:08:15,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:15,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:15,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62833070] [2019-11-16 00:08:15,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:15,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:15,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:15,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:15,008 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-16 00:08:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:15,073 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-16 00:08:15,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:15,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-16 00:08:15,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:15,080 INFO L225 Difference]: With dead ends: 2120 [2019-11-16 00:08:15,080 INFO L226 Difference]: Without dead ends: 1186 [2019-11-16 00:08:15,081 INFO L600 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-11-16 00:08:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-16 00:08:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-16 00:08:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-16 00:08:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-16 00:08:15,114 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-11-16 00:08:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:15,114 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-16 00:08:15,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-16 00:08:15,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-16 00:08:15,117 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:15,117 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:15,117 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:15,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:15,118 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2019-11-16 00:08:15,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:15,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499288311] [2019-11-16 00:08:15,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:15,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:15,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:08:15,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499288311] [2019-11-16 00:08:15,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:15,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:15,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792178406] [2019-11-16 00:08:15,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:15,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:15,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:15,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:15,182 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-11-16 00:08:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:15,246 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-11-16 00:08:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:15,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-16 00:08:15,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:15,253 INFO L225 Difference]: With dead ends: 1423 [2019-11-16 00:08:15,253 INFO L226 Difference]: Without dead ends: 1421 [2019-11-16 00:08:15,254 INFO L600 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-11-16 00:08:15,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-11-16 00:08:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-11-16 00:08:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-16 00:08:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-11-16 00:08:15,293 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-11-16 00:08:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:15,293 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-11-16 00:08:15,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-11-16 00:08:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-16 00:08:15,297 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:15,297 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:15,297 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:15,298 INFO L82 PathProgramCache]: Analyzing trace with hash -618148538, now seen corresponding path program 1 times [2019-11-16 00:08:15,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:15,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929686866] [2019-11-16 00:08:15,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:15,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:15,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:15,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929686866] [2019-11-16 00:08:15,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326367124] [2019-11-16 00:08:15,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/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-11-16 00:08:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:16,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-16 00:08:16,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:16,280 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:16,280 INFO L375 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-11-16 00:08:16,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:16,426 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-16 00:08:16,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:16,436 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|, |v_#memory_$Pointer$.base_161|], 2=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|, |v_#memory_$Pointer$.offset_159|]} [2019-11-16 00:08:16,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 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-11-16 00:08:16,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:16,654 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-16 00:08:16,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:16,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,755 INFO L375 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-11-16 00:08:16,755 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:16,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:16,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,891 INFO L375 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-11-16 00:08:16,892 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:16,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:16,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:16,995 INFO L375 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-11-16 00:08:16,996 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,074 INFO L375 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-11-16 00:08:17,075 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,151 INFO L375 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-11-16 00:08:17,152 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,190 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 13 variables, input treesize:173, output treesize:65 [2019-11-16 00:08:17,222 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_163|], 12=[|v_#memory_$Pointer$.base_162|]} [2019-11-16 00:08:17,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:08:17,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-16 00:08:17,273 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,288 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-16 00:08:17,295 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_164|], 12=[|v_#memory_$Pointer$.base_163|]} [2019-11-16 00:08:17,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:08:17,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-16 00:08:17,361 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,377 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-16 00:08:17,388 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_165|, |v_#memory_$Pointer$.offset_160|, |v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_164|]} [2019-11-16 00:08:17,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:08:17,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:08:17,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,478 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:17,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2019-11-16 00:08:17,536 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,552 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:65 [2019-11-16 00:08:17,560 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_166|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-11-16 00:08:17,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:08:17,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-16 00:08:17,613 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,628 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-16 00:08:17,631 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_167|], 12=[|v_#memory_$Pointer$.base_166|]} [2019-11-16 00:08:17,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:08:17,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-16 00:08:17,677 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,701 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-16 00:08:17,718 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_167|], 12=[|v_#memory_$Pointer$.offset_168|]} [2019-11-16 00:08:17,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,726 INFO L375 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 102 treesize of output 48 [2019-11-16 00:08:17,727 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:17,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-11-16 00:08:17,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:17,768 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:52 [2019-11-16 00:08:17,819 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_161|], 20=[|v_#memory_$Pointer$.offset_169|]} [2019-11-16 00:08:17,822 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:17,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:17,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2019-11-16 00:08:17,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:17,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:17,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:17,894 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:52 [2019-11-16 00:08:18,005 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 20=[|v_#memory_$Pointer$.offset_170|]} [2019-11-16 00:08:18,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:08:18,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:18,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:18,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:18,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:18,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:18,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2019-11-16 00:08:18,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:18,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:18,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:18,090 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:61 [2019-11-16 00:08:18,146 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_168|], 2=[|v_#memory_int_179|], 12=[|v_#memory_$Pointer$.offset_171|]} [2019-11-16 00:08:18,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-16 00:08:18,152 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:18,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:18,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:18,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-16 00:08:18,199 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:18,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:18,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:18,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 26 [2019-11-16 00:08:18,239 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:18,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:18,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:18,262 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:92, output treesize:25 [2019-11-16 00:08:18,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:18,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:18,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:18,311 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:18,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-16 00:08:18,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:18,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:18,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:18,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2019-11-16 00:08:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:08:18,834 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:18,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-16 00:08:18,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027517843] [2019-11-16 00:08:18,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:08:18,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:18,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:08:18,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:08:18,837 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 15 states. [2019-11-16 00:10:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:59,726 INFO L93 Difference]: Finished difference Result 6161 states and 9200 transitions. [2019-11-16 00:10:59,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:10:59,727 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2019-11-16 00:10:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:59,751 INFO L225 Difference]: With dead ends: 6161 [2019-11-16 00:10:59,751 INFO L226 Difference]: Without dead ends: 4761 [2019-11-16 00:10:59,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=167, Invalid=427, Unknown=6, NotChecked=0, Total=600 [2019-11-16 00:10:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2019-11-16 00:10:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 3081. [2019-11-16 00:10:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-11-16 00:10:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4683 transitions. [2019-11-16 00:10:59,885 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4683 transitions. Word has length 164 [2019-11-16 00:10:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:59,885 INFO L462 AbstractCegarLoop]: Abstraction has 3081 states and 4683 transitions. [2019-11-16 00:10:59,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:10:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4683 transitions. [2019-11-16 00:10:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-16 00:10:59,891 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:59,893 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:00,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:00,106 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:00,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash 383929993, now seen corresponding path program 1 times [2019-11-16 00:11:00,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:00,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335425598] [2019-11-16 00:11:00,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:00,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:00,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:11:00,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335425598] [2019-11-16 00:11:00,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:00,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:00,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503965167] [2019-11-16 00:11:00,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:00,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:00,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:00,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:00,289 INFO L87 Difference]: Start difference. First operand 3081 states and 4683 transitions. Second operand 4 states. [2019-11-16 00:11:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:00,858 INFO L93 Difference]: Finished difference Result 6839 states and 10430 transitions. [2019-11-16 00:11:00,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:00,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-16 00:11:00,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:00,877 INFO L225 Difference]: With dead ends: 6839 [2019-11-16 00:11:00,877 INFO L226 Difference]: Without dead ends: 3777 [2019-11-16 00:11:00,881 INFO L600 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-11-16 00:11:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2019-11-16 00:11:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3417. [2019-11-16 00:11:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-11-16 00:11:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5271 transitions. [2019-11-16 00:11:00,994 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5271 transitions. Word has length 172 [2019-11-16 00:11:00,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:00,995 INFO L462 AbstractCegarLoop]: Abstraction has 3417 states and 5271 transitions. [2019-11-16 00:11:00,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5271 transitions. [2019-11-16 00:11:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-16 00:11:01,002 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:01,002 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:01,003 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:01,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:01,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1013795468, now seen corresponding path program 1 times [2019-11-16 00:11:01,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:01,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209430657] [2019-11-16 00:11:01,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:01,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:01,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-16 00:11:01,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209430657] [2019-11-16 00:11:01,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:01,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:01,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674099737] [2019-11-16 00:11:01,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:01,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:01,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:01,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:01,116 INFO L87 Difference]: Start difference. First operand 3417 states and 5271 transitions. Second operand 4 states. [2019-11-16 00:11:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:01,814 INFO L93 Difference]: Finished difference Result 7981 states and 12303 transitions. [2019-11-16 00:11:01,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:01,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-16 00:11:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:01,845 INFO L225 Difference]: With dead ends: 7981 [2019-11-16 00:11:01,852 INFO L226 Difference]: Without dead ends: 4583 [2019-11-16 00:11:01,857 INFO L600 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-11-16 00:11:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-11-16 00:11:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 3885. [2019-11-16 00:11:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-11-16 00:11:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6123 transitions. [2019-11-16 00:11:01,982 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6123 transitions. Word has length 178 [2019-11-16 00:11:01,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:01,983 INFO L462 AbstractCegarLoop]: Abstraction has 3885 states and 6123 transitions. [2019-11-16 00:11:01,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6123 transitions. [2019-11-16 00:11:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-16 00:11:01,991 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:01,991 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:01,992 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:01,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:01,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1355851254, now seen corresponding path program 1 times [2019-11-16 00:11:01,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:01,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513616232] [2019-11-16 00:11:01,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:01,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:01,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-16 00:11:02,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513616232] [2019-11-16 00:11:02,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:02,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:02,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208801917] [2019-11-16 00:11:02,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:02,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:02,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:02,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:02,095 INFO L87 Difference]: Start difference. First operand 3885 states and 6123 transitions. Second operand 4 states. [2019-11-16 00:11:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:02,594 INFO L93 Difference]: Finished difference Result 8399 states and 13080 transitions. [2019-11-16 00:11:02,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:02,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-16 00:11:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:02,604 INFO L225 Difference]: With dead ends: 8399 [2019-11-16 00:11:02,604 INFO L226 Difference]: Without dead ends: 4533 [2019-11-16 00:11:02,609 INFO L600 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-11-16 00:11:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-11-16 00:11:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 3765. [2019-11-16 00:11:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3765 states. [2019-11-16 00:11:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 5895 transitions. [2019-11-16 00:11:02,730 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 5895 transitions. Word has length 179 [2019-11-16 00:11:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:02,731 INFO L462 AbstractCegarLoop]: Abstraction has 3765 states and 5895 transitions. [2019-11-16 00:11:02,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 5895 transitions. [2019-11-16 00:11:02,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-16 00:11:02,740 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:02,740 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:02,741 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash -350011293, now seen corresponding path program 1 times [2019-11-16 00:11:02,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:02,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256830860] [2019-11-16 00:11:02,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:02,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:02,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-16 00:11:02,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256830860] [2019-11-16 00:11:02,923 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:02,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:11:02,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716576706] [2019-11-16 00:11:02,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:11:02,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:02,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:11:02,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:11:02,925 INFO L87 Difference]: Start difference. First operand 3765 states and 5895 transitions. Second operand 5 states. [2019-11-16 00:11:03,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:03,603 INFO L93 Difference]: Finished difference Result 9049 states and 14167 transitions. [2019-11-16 00:11:03,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:03,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-11-16 00:11:03,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:03,620 INFO L225 Difference]: With dead ends: 9049 [2019-11-16 00:11:03,620 INFO L226 Difference]: Without dead ends: 5303 [2019-11-16 00:11:03,624 INFO L600 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-11-16 00:11:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2019-11-16 00:11:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 4239. [2019-11-16 00:11:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2019-11-16 00:11:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 6753 transitions. [2019-11-16 00:11:03,743 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 6753 transitions. Word has length 179 [2019-11-16 00:11:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:03,744 INFO L462 AbstractCegarLoop]: Abstraction has 4239 states and 6753 transitions. [2019-11-16 00:11:03,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:11:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 6753 transitions. [2019-11-16 00:11:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-16 00:11:03,752 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:03,752 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:03,753 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1053443609, now seen corresponding path program 2 times [2019-11-16 00:11:03,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:03,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923445952] [2019-11-16 00:11:03,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:03,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:03,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:11:03,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923445952] [2019-11-16 00:11:03,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:03,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:03,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274314728] [2019-11-16 00:11:03,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:03,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:03,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:03,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:03,843 INFO L87 Difference]: Start difference. First operand 4239 states and 6753 transitions. Second operand 4 states. [2019-11-16 00:11:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:04,578 INFO L93 Difference]: Finished difference Result 7579 states and 11968 transitions. [2019-11-16 00:11:04,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:04,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-16 00:11:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:04,592 INFO L225 Difference]: With dead ends: 7579 [2019-11-16 00:11:04,592 INFO L226 Difference]: Without dead ends: 5405 [2019-11-16 00:11:04,595 INFO L600 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-11-16 00:11:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2019-11-16 00:11:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4383. [2019-11-16 00:11:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-11-16 00:11:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6957 transitions. [2019-11-16 00:11:04,726 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6957 transitions. Word has length 179 [2019-11-16 00:11:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:04,726 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 6957 transitions. [2019-11-16 00:11:04,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6957 transitions. [2019-11-16 00:11:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-16 00:11:04,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:04,734 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:04,735 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:04,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1144686980, now seen corresponding path program 1 times [2019-11-16 00:11:04,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:04,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694702066] [2019-11-16 00:11:04,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:04,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:04,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:11:04,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694702066] [2019-11-16 00:11:04,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:04,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:04,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014298706] [2019-11-16 00:11:04,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:04,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:04,812 INFO L87 Difference]: Start difference. First operand 4383 states and 6957 transitions. Second operand 4 states. [2019-11-16 00:11:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:05,410 INFO L93 Difference]: Finished difference Result 7651 states and 12058 transitions. [2019-11-16 00:11:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:05,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-16 00:11:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:05,421 INFO L225 Difference]: With dead ends: 7651 [2019-11-16 00:11:05,421 INFO L226 Difference]: Without dead ends: 5405 [2019-11-16 00:11:05,424 INFO L600 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-11-16 00:11:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2019-11-16 00:11:05,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4395. [2019-11-16 00:11:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4395 states. [2019-11-16 00:11:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6969 transitions. [2019-11-16 00:11:05,550 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6969 transitions. Word has length 180 [2019-11-16 00:11:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:05,551 INFO L462 AbstractCegarLoop]: Abstraction has 4395 states and 6969 transitions. [2019-11-16 00:11:05,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6969 transitions. [2019-11-16 00:11:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-16 00:11:05,557 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:05,558 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:05,558 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:05,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:05,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2027514623, now seen corresponding path program 1 times [2019-11-16 00:11:05,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:05,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067651346] [2019-11-16 00:11:05,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:05,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:05,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-16 00:11:05,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067651346] [2019-11-16 00:11:05,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:05,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:11:05,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180750712] [2019-11-16 00:11:05,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:11:05,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:05,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:11:05,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:11:05,687 INFO L87 Difference]: Start difference. First operand 4395 states and 6969 transitions. Second operand 5 states. [2019-11-16 00:11:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:06,194 INFO L93 Difference]: Finished difference Result 9973 states and 15769 transitions. [2019-11-16 00:11:06,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:06,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-11-16 00:11:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:06,204 INFO L225 Difference]: With dead ends: 9973 [2019-11-16 00:11:06,204 INFO L226 Difference]: Without dead ends: 5597 [2019-11-16 00:11:06,209 INFO L600 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-11-16 00:11:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2019-11-16 00:11:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4263. [2019-11-16 00:11:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-11-16 00:11:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6789 transitions. [2019-11-16 00:11:06,341 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6789 transitions. Word has length 180 [2019-11-16 00:11:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:06,342 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 6789 transitions. [2019-11-16 00:11:06,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:11:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6789 transitions. [2019-11-16 00:11:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-16 00:11:06,348 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:06,348 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:06,349 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:06,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:06,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2046397566, now seen corresponding path program 1 times [2019-11-16 00:11:06,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:06,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985484336] [2019-11-16 00:11:06,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:06,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:06,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:11:06,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985484336] [2019-11-16 00:11:06,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:06,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:06,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693702508] [2019-11-16 00:11:06,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:06,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:06,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:06,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:06,433 INFO L87 Difference]: Start difference. First operand 4263 states and 6789 transitions. Second operand 4 states. [2019-11-16 00:11:06,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:06,915 INFO L93 Difference]: Finished difference Result 7409 states and 11707 transitions. [2019-11-16 00:11:06,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:06,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-16 00:11:06,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:06,923 INFO L225 Difference]: With dead ends: 7409 [2019-11-16 00:11:06,923 INFO L226 Difference]: Without dead ends: 5223 [2019-11-16 00:11:06,926 INFO L600 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-11-16 00:11:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5223 states. [2019-11-16 00:11:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5223 to 4275. [2019-11-16 00:11:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-11-16 00:11:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6801 transitions. [2019-11-16 00:11:07,052 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6801 transitions. Word has length 181 [2019-11-16 00:11:07,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:07,052 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 6801 transitions. [2019-11-16 00:11:07,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6801 transitions. [2019-11-16 00:11:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-16 00:11:07,058 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:07,059 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:07,059 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:07,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:07,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1992179255, now seen corresponding path program 1 times [2019-11-16 00:11:07,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:07,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282222752] [2019-11-16 00:11:07,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:07,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:07,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:11:07,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282222752] [2019-11-16 00:11:07,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:07,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:07,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151274239] [2019-11-16 00:11:07,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:07,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:07,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:07,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:07,146 INFO L87 Difference]: Start difference. First operand 4275 states and 6801 transitions. Second operand 4 states. [2019-11-16 00:11:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:07,650 INFO L93 Difference]: Finished difference Result 7355 states and 11629 transitions. [2019-11-16 00:11:07,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:07,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-16 00:11:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:07,657 INFO L225 Difference]: With dead ends: 7355 [2019-11-16 00:11:07,657 INFO L226 Difference]: Without dead ends: 5163 [2019-11-16 00:11:07,660 INFO L600 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-11-16 00:11:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2019-11-16 00:11:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 4287. [2019-11-16 00:11:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-16 00:11:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6813 transitions. [2019-11-16 00:11:07,788 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6813 transitions. Word has length 182 [2019-11-16 00:11:07,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:07,788 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6813 transitions. [2019-11-16 00:11:07,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6813 transitions. [2019-11-16 00:11:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-16 00:11:07,794 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:07,795 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:07,795 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:07,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:07,795 INFO L82 PathProgramCache]: Analyzing trace with hash -699433533, now seen corresponding path program 1 times [2019-11-16 00:11:07,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:07,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999026259] [2019-11-16 00:11:07,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:07,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:07,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:11:07,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999026259] [2019-11-16 00:11:07,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:07,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:07,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220179958] [2019-11-16 00:11:07,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:07,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:07,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:07,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:07,879 INFO L87 Difference]: Start difference. First operand 4287 states and 6813 transitions. Second operand 4 states. [2019-11-16 00:11:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:08,360 INFO L93 Difference]: Finished difference Result 8903 states and 14078 transitions. [2019-11-16 00:11:08,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:08,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-16 00:11:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:08,366 INFO L225 Difference]: With dead ends: 8903 [2019-11-16 00:11:08,367 INFO L226 Difference]: Without dead ends: 4635 [2019-11-16 00:11:08,371 INFO L600 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-11-16 00:11:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-16 00:11:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-16 00:11:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-16 00:11:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6801 transitions. [2019-11-16 00:11:08,503 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6801 transitions. Word has length 186 [2019-11-16 00:11:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:08,504 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6801 transitions. [2019-11-16 00:11:08,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6801 transitions. [2019-11-16 00:11:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-16 00:11:08,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:08,510 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:08,511 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1460921410, now seen corresponding path program 1 times [2019-11-16 00:11:08,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:08,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485209342] [2019-11-16 00:11:08,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:08,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:08,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:11:08,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485209342] [2019-11-16 00:11:08,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:08,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:08,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701125686] [2019-11-16 00:11:08,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:08,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:08,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:08,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:08,605 INFO L87 Difference]: Start difference. First operand 4287 states and 6801 transitions. Second operand 4 states. [2019-11-16 00:11:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:09,040 INFO L93 Difference]: Finished difference Result 6833 states and 10743 transitions. [2019-11-16 00:11:09,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:09,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-16 00:11:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:09,044 INFO L225 Difference]: With dead ends: 6833 [2019-11-16 00:11:09,044 INFO L226 Difference]: Without dead ends: 4635 [2019-11-16 00:11:09,047 INFO L600 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-11-16 00:11:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-16 00:11:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-16 00:11:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-16 00:11:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6789 transitions. [2019-11-16 00:11:09,175 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6789 transitions. Word has length 187 [2019-11-16 00:11:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:09,175 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6789 transitions. [2019-11-16 00:11:09,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6789 transitions. [2019-11-16 00:11:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-16 00:11:09,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:09,182 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:09,182 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:09,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:09,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1574944825, now seen corresponding path program 1 times [2019-11-16 00:11:09,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:09,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103329078] [2019-11-16 00:11:09,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:09,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:09,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:11:09,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103329078] [2019-11-16 00:11:09,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:09,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:09,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694799649] [2019-11-16 00:11:09,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:09,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:09,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:09,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:09,355 INFO L87 Difference]: Start difference. First operand 4287 states and 6789 transitions. Second operand 4 states. [2019-11-16 00:11:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:09,768 INFO L93 Difference]: Finished difference Result 6833 states and 10725 transitions. [2019-11-16 00:11:09,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:09,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-16 00:11:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:09,773 INFO L225 Difference]: With dead ends: 6833 [2019-11-16 00:11:09,773 INFO L226 Difference]: Without dead ends: 4635 [2019-11-16 00:11:09,776 INFO L600 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-11-16 00:11:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-16 00:11:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-16 00:11:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-16 00:11:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6777 transitions. [2019-11-16 00:11:09,905 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6777 transitions. Word has length 188 [2019-11-16 00:11:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:09,905 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6777 transitions. [2019-11-16 00:11:09,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6777 transitions. [2019-11-16 00:11:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-16 00:11:09,911 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:09,911 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:09,911 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:09,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1346205799, now seen corresponding path program 1 times [2019-11-16 00:11:09,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:09,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078165726] [2019-11-16 00:11:09,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:09,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:09,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:09,986 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:11:09,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078165726] [2019-11-16 00:11:09,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:09,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:09,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208776610] [2019-11-16 00:11:09,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:09,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:09,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:09,988 INFO L87 Difference]: Start difference. First operand 4287 states and 6777 transitions. Second operand 4 states. [2019-11-16 00:11:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:10,416 INFO L93 Difference]: Finished difference Result 6833 states and 10707 transitions. [2019-11-16 00:11:10,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:10,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-16 00:11:10,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:10,420 INFO L225 Difference]: With dead ends: 6833 [2019-11-16 00:11:10,420 INFO L226 Difference]: Without dead ends: 4635 [2019-11-16 00:11:10,422 INFO L600 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-11-16 00:11:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-16 00:11:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-16 00:11:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-16 00:11:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6765 transitions. [2019-11-16 00:11:10,538 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6765 transitions. Word has length 189 [2019-11-16 00:11:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:10,538 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6765 transitions. [2019-11-16 00:11:10,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6765 transitions. [2019-11-16 00:11:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-16 00:11:10,545 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:10,545 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:10,546 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:10,546 INFO L82 PathProgramCache]: Analyzing trace with hash -43681972, now seen corresponding path program 1 times [2019-11-16 00:11:10,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:10,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096964988] [2019-11-16 00:11:10,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:10,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:10,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:11:10,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096964988] [2019-11-16 00:11:10,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:10,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:10,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813399724] [2019-11-16 00:11:10,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:10,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:10,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:10,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:10,628 INFO L87 Difference]: Start difference. First operand 4287 states and 6765 transitions. Second operand 4 states. [2019-11-16 00:11:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:11,142 INFO L93 Difference]: Finished difference Result 6773 states and 10617 transitions. [2019-11-16 00:11:11,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:11,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-16 00:11:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:11,146 INFO L225 Difference]: With dead ends: 6773 [2019-11-16 00:11:11,146 INFO L226 Difference]: Without dead ends: 4575 [2019-11-16 00:11:11,149 INFO L600 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-11-16 00:11:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-11-16 00:11:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4287. [2019-11-16 00:11:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-16 00:11:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6753 transitions. [2019-11-16 00:11:11,238 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6753 transitions. Word has length 190 [2019-11-16 00:11:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:11,238 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6753 transitions. [2019-11-16 00:11:11,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6753 transitions. [2019-11-16 00:11:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-16 00:11:11,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:11,243 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:11,243 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:11,243 INFO L82 PathProgramCache]: Analyzing trace with hash 396872042, now seen corresponding path program 1 times [2019-11-16 00:11:11,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:11,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483622750] [2019-11-16 00:11:11,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:11,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:11,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-16 00:11:11,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483622750] [2019-11-16 00:11:11,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:11,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:11,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258795316] [2019-11-16 00:11:11,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:11,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:11,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:11,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:11,322 INFO L87 Difference]: Start difference. First operand 4287 states and 6753 transitions. Second operand 4 states. [2019-11-16 00:11:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:11,922 INFO L93 Difference]: Finished difference Result 7097 states and 11097 transitions. [2019-11-16 00:11:11,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:11,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-16 00:11:11,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:11,925 INFO L225 Difference]: With dead ends: 7097 [2019-11-16 00:11:11,925 INFO L226 Difference]: Without dead ends: 4899 [2019-11-16 00:11:11,927 INFO L600 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-11-16 00:11:11,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2019-11-16 00:11:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 4359. [2019-11-16 00:11:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2019-11-16 00:11:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6849 transitions. [2019-11-16 00:11:12,020 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6849 transitions. Word has length 192 [2019-11-16 00:11:12,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:12,021 INFO L462 AbstractCegarLoop]: Abstraction has 4359 states and 6849 transitions. [2019-11-16 00:11:12,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:12,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6849 transitions. [2019-11-16 00:11:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-16 00:11:12,025 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:12,026 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:12,026 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:12,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:12,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2029162413, now seen corresponding path program 1 times [2019-11-16 00:11:12,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:12,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195086926] [2019-11-16 00:11:12,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:12,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:12,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-16 00:11:12,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195086926] [2019-11-16 00:11:12,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:12,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:12,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598993929] [2019-11-16 00:11:12,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:12,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:12,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:12,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:12,110 INFO L87 Difference]: Start difference. First operand 4359 states and 6849 transitions. Second operand 4 states. [2019-11-16 00:11:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:12,748 INFO L93 Difference]: Finished difference Result 7097 states and 11079 transitions. [2019-11-16 00:11:12,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:12,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-16 00:11:12,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:12,755 INFO L225 Difference]: With dead ends: 7097 [2019-11-16 00:11:12,755 INFO L226 Difference]: Without dead ends: 4899 [2019-11-16 00:11:12,758 INFO L600 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-11-16 00:11:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2019-11-16 00:11:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 4365. [2019-11-16 00:11:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4365 states. [2019-11-16 00:11:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 6849 transitions. [2019-11-16 00:11:12,877 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 6849 transitions. Word has length 193 [2019-11-16 00:11:12,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:12,877 INFO L462 AbstractCegarLoop]: Abstraction has 4365 states and 6849 transitions. [2019-11-16 00:11:12,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 6849 transitions. [2019-11-16 00:11:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-16 00:11:12,880 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:12,880 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:12,880 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:12,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:12,880 INFO L82 PathProgramCache]: Analyzing trace with hash -166759969, now seen corresponding path program 1 times [2019-11-16 00:11:12,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:12,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880549475] [2019-11-16 00:11:12,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:12,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:12,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:11:12,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880549475] [2019-11-16 00:11:12,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:12,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:12,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570320941] [2019-11-16 00:11:12,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:12,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:12,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:12,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:12,962 INFO L87 Difference]: Start difference. First operand 4365 states and 6849 transitions. Second operand 4 states. [2019-11-16 00:11:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:13,476 INFO L93 Difference]: Finished difference Result 7679 states and 11977 transitions. [2019-11-16 00:11:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:13,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-16 00:11:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:13,481 INFO L225 Difference]: With dead ends: 7679 [2019-11-16 00:11:13,481 INFO L226 Difference]: Without dead ends: 5481 [2019-11-16 00:11:13,485 INFO L600 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-11-16 00:11:13,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2019-11-16 00:11:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 4509. [2019-11-16 00:11:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4509 states. [2019-11-16 00:11:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 7053 transitions. [2019-11-16 00:11:13,590 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 7053 transitions. Word has length 193 [2019-11-16 00:11:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:13,591 INFO L462 AbstractCegarLoop]: Abstraction has 4509 states and 7053 transitions. [2019-11-16 00:11:13,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 7053 transitions. [2019-11-16 00:11:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-16 00:11:13,594 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:13,594 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:13,594 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:13,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:13,594 INFO L82 PathProgramCache]: Analyzing trace with hash -512641310, now seen corresponding path program 1 times [2019-11-16 00:11:13,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:13,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787683705] [2019-11-16 00:11:13,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:13,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:13,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:13,902 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:13,903 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:11:14,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:11:14 BoogieIcfgContainer [2019-11-16 00:11:14,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:11:14,064 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:11:14,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:11:14,065 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:11:14,065 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:07:54" (3/4) ... [2019-11-16 00:11:14,068 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:11:14,068 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:11:14,070 INFO L168 Benchmark]: Toolchain (without parser) took 201822.44 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 734.5 MB). Free memory was 939.4 MB in the beginning and 981.1 MB in the end (delta: -41.7 MB). Peak memory consumption was 692.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:14,070 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:14,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:14,071 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.63 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-11-16 00:11:14,071 INFO L168 Benchmark]: Boogie Preprocessor took 138.99 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:14,071 INFO L168 Benchmark]: RCFGBuilder took 1282.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:14,072 INFO L168 Benchmark]: TraceAbstraction took 199565.01 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 572.5 MB). Free memory was 1.0 GB in the beginning and 981.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 616.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:14,072 INFO L168 Benchmark]: Witness Printer took 4.14 ms. Allocated memory is still 1.8 GB. Free memory is still 981.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:14,074 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 713.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 113.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 138.99 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1282.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 199565.01 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 572.5 MB). Free memory was 1.0 GB in the beginning and 981.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 616.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.14 ms. Allocated memory is still 1.8 GB. Free memory is still 981.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-3:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-3:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-3:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-3:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-3:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-3:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND TRUE s->state == 8656 [L1570] EXPR s->session [L1570] EXPR s->s3 [L1570] EXPR (s->s3)->tmp.new_cipher [L1570] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={-3:0}] [L1583] COND FALSE !(ret <= 0) [L1588] s->state = 8672 [L1589] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1590] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1235] COND TRUE s->state == 8672 [L1599] ret = __VERIFIER_nondet_int() [L1600] COND TRUE blastFlag == 3 [L1601] blastFlag = 4 VAL [init=1, SSLv3_server_data={-3:0}] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={-3:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-3:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 199.4s, OverallIterations: 64, TraceHistogramMax: 7, AutomataDifference: 186.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 13537 SDtfs, 5433 SDslu, 20536 SDs, 0 SdLazy, 14054 SolverSat, 862 SolverUnsat, 66 SolverUnknown, 0 SolverNotchecked, 154.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 299 SyntacticMatches, 39 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 26.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4509occurred in iteration=63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 63 MinimizatonAttempts, 14607 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 7118 NumberOfCodeBlocks, 7118 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 6861 ConstructedInterpolants, 74 QuantifiedInterpolants, 3569507 SizeOfPredicates, 12 NumberOfNonLiveVariables, 603 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 64 InterpolantComputations, 62 PerfectInterpolantSequences, 6740/7071 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:11:16,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:11:16,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:11:16,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:11:16,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:11:16,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:11:16,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:11:16,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:11:16,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:11:16,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:11:16,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:11:16,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:11:16,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:11:16,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:11:16,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:11:16,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:11:16,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:11:16,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:11:16,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:11:16,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:11:16,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:11:16,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:11:16,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:11:16,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:11:16,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:11:16,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:11:16,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:11:16,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:11:16,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:11:16,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:11:16,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:11:16,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:11:16,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:11:16,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:11:16,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:11:16,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:11:16,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:11:16,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:11:16,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:11:16,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:11:16,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:11:16,365 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:11:16,379 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:11:16,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:11:16,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:11:16,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:11:16,381 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:11:16,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:11:16,382 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:11:16,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:11:16,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:11:16,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:11:16,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:11:16,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:11:16,383 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:11:16,383 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:11:16,383 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:11:16,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:11:16,384 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:11:16,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:11:16,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:11:16,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:11:16,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:11:16,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:11:16,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:11:16,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:11:16,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:11:16,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:11:16,386 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:11:16,386 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:11:16,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:11:16,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:11:16,387 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_3e209bc0-4d70-4970-84a3-f636d2d0b50f/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 -> 62062b34b4a23d127db54f6c179288673b97bcab [2019-11-16 00:11:16,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:11:16,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:11:16,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:11:16,443 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:11:16,443 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:11:16,445 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c [2019-11-16 00:11:16,508 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/data/720ec6da9/a62255d8ed0246618044b5d2b96af6f2/FLAG4a77cae8c [2019-11-16 00:11:17,061 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:11:17,062 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c [2019-11-16 00:11:17,093 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/data/720ec6da9/a62255d8ed0246618044b5d2b96af6f2/FLAG4a77cae8c [2019-11-16 00:11:17,332 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/data/720ec6da9/a62255d8ed0246618044b5d2b96af6f2 [2019-11-16 00:11:17,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:11:17,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:11:17,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:17,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:11:17,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:11:17,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:17" (1/1) ... [2019-11-16 00:11:17,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fdce0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:17, skipping insertion in model container [2019-11-16 00:11:17,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:17" (1/1) ... [2019-11-16 00:11:17,351 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:11:17,435 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:11:17,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:18,024 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:11:18,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:18,164 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:11:18,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:18 WrapperNode [2019-11-16 00:11:18,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:18,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:11:18,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:11:18,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:11:18,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:18" (1/1) ... [2019-11-16 00:11:18,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:18" (1/1) ... [2019-11-16 00:11:18,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:11:18,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:11:18,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:11:18,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:11:18,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:18" (1/1) ... [2019-11-16 00:11:18,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:18" (1/1) ... [2019-11-16 00:11:18,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:18" (1/1) ... [2019-11-16 00:11:18,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:18" (1/1) ... [2019-11-16 00:11:18,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:18" (1/1) ... [2019-11-16 00:11:18,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:18" (1/1) ... [2019-11-16 00:11:18,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:18" (1/1) ... [2019-11-16 00:11:18,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:11:18,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:11:18,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:11:18,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:11:18,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/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-11-16 00:11:18,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:11:18,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:11:18,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:11:18,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:11:18,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:11:18,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:11:18,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:11:18,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:11:18,731 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:11:22,001 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-16 00:11:22,001 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-16 00:11:22,002 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:11:22,002 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:11:22,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:22 BoogieIcfgContainer [2019-11-16 00:11:22,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:11:22,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:11:22,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:11:22,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:11:22,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:11:17" (1/3) ... [2019-11-16 00:11:22,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540c0b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:22, skipping insertion in model container [2019-11-16 00:11:22,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:18" (2/3) ... [2019-11-16 00:11:22,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540c0b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:22, skipping insertion in model container [2019-11-16 00:11:22,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:22" (3/3) ... [2019-11-16 00:11:22,016 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-2.c [2019-11-16 00:11:22,025 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:11:22,035 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:11:22,044 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:11:22,062 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:11:22,062 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:11:22,062 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:11:22,062 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:11:22,062 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:11:22,062 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:11:22,062 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:11:22,062 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:11:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-16 00:11:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:11:22,087 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:22,088 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:22,090 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:22,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-11-16 00:11:22,103 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:11:22,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [212038305] [2019-11-16 00:11:22,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:11:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:22,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:11:22,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:22,380 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:11:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:22,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [212038305] [2019-11-16 00:11:22,410 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:22,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:11:22,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055395742] [2019-11-16 00:11:22,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:22,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:11:22,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:22,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:22,433 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-16 00:11:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:22,648 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-11-16 00:11:22,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:22,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-16 00:11:22,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:22,665 INFO L225 Difference]: With dead ends: 564 [2019-11-16 00:11:22,666 INFO L226 Difference]: Without dead ends: 385 [2019-11-16 00:11:22,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-16 00:11:22,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-11-16 00:11:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-16 00:11:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-11-16 00:11:22,747 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-11-16 00:11:22,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:22,748 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-11-16 00:11:22,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:22,748 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-11-16 00:11:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:11:22,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:22,758 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:22,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:11:22,968 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:22,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:22,969 INFO L82 PathProgramCache]: Analyzing trace with hash -718881007, now seen corresponding path program 1 times [2019-11-16 00:11:22,969 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:11:22,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [869453359] [2019-11-16 00:11:22,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:11:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:23,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:11:23,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:23,191 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:11:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:23,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [869453359] [2019-11-16 00:11:23,212 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:23,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:11:23,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860234463] [2019-11-16 00:11:23,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:23,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:11:23,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:23,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:23,215 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-11-16 00:11:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:24,075 INFO L93 Difference]: Finished difference Result 879 states and 1352 transitions. [2019-11-16 00:11:24,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:24,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-16 00:11:24,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:24,081 INFO L225 Difference]: With dead ends: 879 [2019-11-16 00:11:24,081 INFO L226 Difference]: Without dead ends: 628 [2019-11-16 00:11:24,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-11-16 00:11:24,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2019-11-16 00:11:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-16 00:11:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 949 transitions. [2019-11-16 00:11:24,142 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 949 transitions. Word has length 58 [2019-11-16 00:11:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:24,144 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 949 transitions. [2019-11-16 00:11:24,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 949 transitions. [2019-11-16 00:11:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-16 00:11:24,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:24,154 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:24,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:11:24,356 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:24,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:24,357 INFO L82 PathProgramCache]: Analyzing trace with hash 317355092, now seen corresponding path program 1 times [2019-11-16 00:11:24,358 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:11:24,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1033946808] [2019-11-16 00:11:24,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:11:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:24,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:11:24,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:11:24,709 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:11:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:11:24,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1033946808] [2019-11-16 00:11:24,759 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:24,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:11:24,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051552927] [2019-11-16 00:11:24,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:24,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:11:24,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:24,764 INFO L87 Difference]: Start difference. First operand 626 states and 949 transitions. Second operand 4 states. [2019-11-16 00:11:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:25,138 INFO L93 Difference]: Finished difference Result 1364 states and 2080 transitions. [2019-11-16 00:11:25,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:25,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-16 00:11:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:25,144 INFO L225 Difference]: With dead ends: 1364 [2019-11-16 00:11:25,145 INFO L226 Difference]: Without dead ends: 870 [2019-11-16 00:11:25,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-11-16 00:11:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2019-11-16 00:11:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-11-16 00:11:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1317 transitions. [2019-11-16 00:11:25,185 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1317 transitions. Word has length 119 [2019-11-16 00:11:25,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:25,185 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 1317 transitions. [2019-11-16 00:11:25,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1317 transitions. [2019-11-16 00:11:25,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-16 00:11:25,188 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:25,189 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:25,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:11:25,397 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:25,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1698938047, now seen corresponding path program 1 times [2019-11-16 00:11:25,399 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:11:25,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1519767122] [2019-11-16 00:11:25,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:11:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:25,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:11:25,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:11:25,691 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:11:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:11:25,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1519767122] [2019-11-16 00:11:25,726 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:25,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:11:25,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82919118] [2019-11-16 00:11:25,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:11:25,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:11:25,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:11:25,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:25,728 INFO L87 Difference]: Start difference. First operand 870 states and 1317 transitions. Second operand 4 states. [2019-11-16 00:11:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:26,829 INFO L93 Difference]: Finished difference Result 1852 states and 2814 transitions. [2019-11-16 00:11:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:11:26,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-16 00:11:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:26,836 INFO L225 Difference]: With dead ends: 1852 [2019-11-16 00:11:26,836 INFO L226 Difference]: Without dead ends: 1114 [2019-11-16 00:11:26,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:11:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2019-11-16 00:11:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1114. [2019-11-16 00:11:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-11-16 00:11:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1682 transitions. [2019-11-16 00:11:26,891 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1682 transitions. Word has length 147 [2019-11-16 00:11:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:26,893 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 1682 transitions. [2019-11-16 00:11:26,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:11:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1682 transitions. [2019-11-16 00:11:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-16 00:11:26,900 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:26,900 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:27,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:11:27,104 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash -618148538, now seen corresponding path program 1 times [2019-11-16 00:11:27,106 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:11:27,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [131126614] [2019-11-16 00:11:27,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e209bc0-4d70-4970-84a3-f636d2d0b50f/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:11:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:28,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-16 00:11:28,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:28,539 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:28,539 INFO L375 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-11-16 00:11:28,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:28,918 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-16 00:11:28,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:28,921 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_176|], 2=[|v_#memory_$Pointer$.base_173|, |v_#memory_$Pointer$.base_172|]} [2019-11-16 00:11:28,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:28,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:28,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:28,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:28,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:28,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,078 INFO L375 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-11-16 00:11:29,078 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,263 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-16 00:11:29,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,330 INFO L375 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-11-16 00:11:29,331 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,445 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-16 00:11:29,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,474 INFO L375 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-11-16 00:11:29,475 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,527 INFO L496 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-11-16 00:11:29,527 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-16 00:11:29,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,576 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-16 00:11:29,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-16 00:11:29,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,636 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-16 00:11:29,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-16 00:11:29,666 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_174|], 12=[|v_#memory_$Pointer$.base_179|]} [2019-11-16 00:11:29,677 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:29,778 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-16 00:11:29,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,795 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2019-11-16 00:11:29,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-16 00:11:29,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,857 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-16 00:11:29,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-16 00:11:29,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-16 00:11:29,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:29,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:29,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-16 00:11:29,944 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_172|], 20=[|v_#memory_$Pointer$.base_182|]} [2019-11-16 00:11:29,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:29,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-16 00:11:29,954 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:30,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:30,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:30,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:30,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:30,643 WARN L191 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-11-16 00:11:30,643 INFO L341 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-16 00:11:30,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-16 00:11:30,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:30,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:30,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:30,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:30,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:30,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:30,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:30,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:30,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:30,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:30,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:30,839 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-11-16 00:11:30,839 INFO L567 ElimStorePlain]: treesize reduction 1039, result has 7.5 percent of original size [2019-11-16 00:11:30,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:30,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:83 [2019-11-16 00:11:30,906 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_175|], 30=[|v_#memory_$Pointer$.base_183|]} [2019-11-16 00:11:30,911 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:31,039 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-16 00:11:31,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:31,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:31,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:31,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:31,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:31,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:31,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:31,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:31,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:31,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:31,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:04,192 WARN L191 SmtUtils]: Spent 33.12 s on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2019-11-16 00:12:04,193 INFO L341 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-16 00:12:04,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 338 [2019-11-16 00:12:04,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:04,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:04,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:04,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:12:04,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:04,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:04,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:04,204 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:04,560 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 40 [2019-11-16 00:12:04,561 INFO L567 ElimStorePlain]: treesize reduction 2282, result has 3.9 percent of original size [2019-11-16 00:12:04,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:04,562 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-16 00:12:04,613 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_192|], 30=[|v_#memory_$Pointer$.base_184|]} [2019-11-16 00:12:04,637 INFO L375 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-11-16 00:12:04,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:04,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:04,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:04,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:04,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:04,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:04,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:04,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:21,216 WARN L191 SmtUtils]: Spent 16.48 s on a formula simplification that was a NOOP. DAG size: 85 [2019-11-16 00:12:21,217 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:21,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 263 [2019-11-16 00:12:21,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:21,493 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 42 [2019-11-16 00:12:21,494 INFO L567 ElimStorePlain]: treesize reduction 1121, result has 7.6 percent of original size [2019-11-16 00:12:21,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:21,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-16 00:12:21,546 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_173|], 2=[|v_#memory_int_193|], 20=[|v_#memory_$Pointer$.base_185|]} [2019-11-16 00:12:21,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-16 00:12:21,567 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:21,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:21,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-11-16 00:12:21,631 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:21,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:21,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:21,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:21,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:21,850 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-16 00:12:21,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:21,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-16 00:12:21,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:21,903 INFO L496 ElimStorePlain]: Start of recursive call 4: 22 dim-0 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2019-11-16 00:12:23,226 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 264 DAG size of output: 149 [2019-11-16 00:12:23,226 INFO L567 ElimStorePlain]: treesize reduction 568, result has 31.1 percent of original size [2019-11-16 00:12:23,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 22 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:23,230 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:168 [2019-11-16 00:12:23,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:23,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-16 00:12:23,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:23,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:23,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:23,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-16 00:12:23,461 INFO L375 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 31 treesize of output 13 [2019-11-16 00:12:23,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:23,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:23,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:23,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-16 00:12:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:12:23,777 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:12:23,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-16 00:12:23,859 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:23,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:23,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:23,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-16 00:12:23,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:23,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:24,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:12:24,134 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-11-16 00:12:24,138 INFO L168 Benchmark]: Toolchain (without parser) took 66802.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.6 MB). Free memory was 947.0 MB in the beginning and 827.9 MB in the end (delta: 119.1 MB). Peak memory consumption was 423.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:24,139 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:12:24,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:24,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.05 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:24,140 INFO L168 Benchmark]: Boogie Preprocessor took 137.70 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:24,140 INFO L168 Benchmark]: RCFGBuilder took 3601.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.5 MB in the end (delta: 94.6 MB). Peak memory consumption was 94.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:24,141 INFO L168 Benchmark]: TraceAbstraction took 62132.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 980.5 MB in the beginning and 827.9 MB in the end (delta: 152.7 MB). Peak memory consumption was 334.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:24,144 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 827.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.05 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 137.70 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3601.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.5 MB in the end (delta: 94.6 MB). Peak memory consumption was 94.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 62132.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 980.5 MB in the beginning and 827.9 MB in the end (delta: 152.7 MB). Peak memory consumption was 334.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...