./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/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 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/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 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 .............................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:50:37,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:50:38,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:50:38,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:50:38,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:50:38,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:50:38,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:50:38,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:50:38,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:50:38,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:50:38,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:50:38,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:50:38,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:50:38,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:50:38,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:50:38,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:50:38,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:50:38,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:50:38,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:50:38,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:50:38,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:50:38,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:50:38,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:50:38,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:50:38,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:50:38,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:50:38,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:50:38,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:50:38,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:50:38,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:50:38,067 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:50:38,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:50:38,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:50:38,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:50:38,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:50:38,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:50:38,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:50:38,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:50:38,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:50:38,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:50:38,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:50:38,074 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:50:38,098 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:50:38,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:50:38,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:50:38,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:50:38,107 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:50:38,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:50:38,108 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:50:38,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:50:38,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:50:38,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:50:38,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:50:38,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:50:38,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:50:38,109 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:50:38,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:50:38,109 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:50:38,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:50:38,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:50:38,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:50:38,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:50:38,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:50:38,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:50:38,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:50:38,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:50:38,111 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:50:38,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:50:38,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:50:38,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:50:38,112 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_a210a84f-f0fc-4f29-8cd3-b04625513650/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 -> 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 [2019-11-25 08:50:38,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:50:38,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:50:38,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:50:38,286 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:50:38,286 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:50:38,287 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-25 08:50:38,348 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/data/78b3a781d/ecf17650f08f4bf0b7e541cbf1d913e9/FLAGfc6554ee4 [2019-11-25 08:50:38,870 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:50:38,870 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-25 08:50:38,891 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/data/78b3a781d/ecf17650f08f4bf0b7e541cbf1d913e9/FLAGfc6554ee4 [2019-11-25 08:50:39,078 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/data/78b3a781d/ecf17650f08f4bf0b7e541cbf1d913e9 [2019-11-25 08:50:39,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:50:39,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:50:39,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:39,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:50:39,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:50:39,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:39" (1/1) ... [2019-11-25 08:50:39,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5cbd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39, skipping insertion in model container [2019-11-25 08:50:39,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:39" (1/1) ... [2019-11-25 08:50:39,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:50:39,158 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:50:39,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:39,724 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:50:39,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:39,848 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:50:39,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39 WrapperNode [2019-11-25 08:50:39,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:39,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:39,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:50:39,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:50:39,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39" (1/1) ... [2019-11-25 08:50:39,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39" (1/1) ... [2019-11-25 08:50:39,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:39,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:50:39,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:50:39,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:50:39,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39" (1/1) ... [2019-11-25 08:50:39,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39" (1/1) ... [2019-11-25 08:50:39,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39" (1/1) ... [2019-11-25 08:50:39,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39" (1/1) ... [2019-11-25 08:50:40,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39" (1/1) ... [2019-11-25 08:50:40,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39" (1/1) ... [2019-11-25 08:50:40,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39" (1/1) ... [2019-11-25 08:50:40,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:50:40,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:50:40,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:50:40,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:50:40,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/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-25 08:50:40,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:50:40,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:50:40,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:50:40,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:50:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:50:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:50:40,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:50:40,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:50:40,443 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:50:41,542 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-25 08:50:41,543 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-25 08:50:41,544 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:50:41,544 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:50:41,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:41 BoogieIcfgContainer [2019-11-25 08:50:41,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:50:41,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:50:41,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:50:41,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:50:41,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:50:39" (1/3) ... [2019-11-25 08:50:41,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349674a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:41, skipping insertion in model container [2019-11-25 08:50:41,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:39" (2/3) ... [2019-11-25 08:50:41,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349674a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:41, skipping insertion in model container [2019-11-25 08:50:41,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:41" (3/3) ... [2019-11-25 08:50:41,560 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2019-11-25 08:50:41,573 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:50:41,583 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:50:41,595 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:50:41,622 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:50:41,622 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:50:41,623 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:50:41,623 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:50:41,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:50:41,623 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:50:41,623 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:50:41,624 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:50:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-11-25 08:50:41,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:50:41,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:41,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:41,656 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-11-25 08:50:41,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:41,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243261701] [2019-11-25 08:50:41,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:41,964 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-25 08:50:41,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243261701] [2019-11-25 08:50:41,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:41,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:41,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600716246] [2019-11-25 08:50:41,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:41,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:41,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:41,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:41,985 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-11-25 08:50:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:42,484 INFO L93 Difference]: Finished difference Result 317 states and 530 transitions. [2019-11-25 08:50:42,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:42,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-25 08:50:42,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:42,507 INFO L225 Difference]: With dead ends: 317 [2019-11-25 08:50:42,507 INFO L226 Difference]: Without dead ends: 160 [2019-11-25 08:50:42,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-25 08:50:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-11-25 08:50:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 08:50:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2019-11-25 08:50:42,551 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 45 [2019-11-25 08:50:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:42,551 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2019-11-25 08:50:42,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2019-11-25 08:50:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-25 08:50:42,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:42,555 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:42,555 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:42,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:42,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1923702817, now seen corresponding path program 1 times [2019-11-25 08:50:42,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:42,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974894921] [2019-11-25 08:50:42,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:42,728 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-25 08:50:42,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974894921] [2019-11-25 08:50:42,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:42,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:42,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572011816] [2019-11-25 08:50:42,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:42,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:42,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:42,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:42,732 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand 4 states. [2019-11-25 08:50:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:43,073 INFO L93 Difference]: Finished difference Result 284 states and 429 transitions. [2019-11-25 08:50:43,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:43,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-25 08:50:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:43,076 INFO L225 Difference]: With dead ends: 284 [2019-11-25 08:50:43,076 INFO L226 Difference]: Without dead ends: 160 [2019-11-25 08:50:43,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-25 08:50:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-11-25 08:50:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 08:50:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2019-11-25 08:50:43,102 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 58 [2019-11-25 08:50:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:43,102 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2019-11-25 08:50:43,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2019-11-25 08:50:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:50:43,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:43,105 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:43,106 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:43,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:43,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2009873572, now seen corresponding path program 1 times [2019-11-25 08:50:43,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:43,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089474146] [2019-11-25 08:50:43,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:43,302 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-25 08:50:43,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089474146] [2019-11-25 08:50:43,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:43,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:43,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692137736] [2019-11-25 08:50:43,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:43,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:43,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:43,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:43,316 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand 4 states. [2019-11-25 08:50:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:43,695 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2019-11-25 08:50:43,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:43,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:50:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:43,697 INFO L225 Difference]: With dead ends: 282 [2019-11-25 08:50:43,698 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 08:50:43,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 08:50:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2019-11-25 08:50:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 08:50:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2019-11-25 08:50:43,709 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 59 [2019-11-25 08:50:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:43,709 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2019-11-25 08:50:43,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2019-11-25 08:50:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:50:43,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:43,712 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:43,712 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:43,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1439655328, now seen corresponding path program 1 times [2019-11-25 08:50:43,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:43,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631242306] [2019-11-25 08:50:43,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:43,779 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-25 08:50:43,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631242306] [2019-11-25 08:50:43,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:43,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:43,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582869435] [2019-11-25 08:50:43,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:43,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:43,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:43,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:43,781 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand 4 states. [2019-11-25 08:50:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:44,134 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2019-11-25 08:50:44,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:44,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:50:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:44,137 INFO L225 Difference]: With dead ends: 281 [2019-11-25 08:50:44,137 INFO L226 Difference]: Without dead ends: 157 [2019-11-25 08:50:44,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:44,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-25 08:50:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2019-11-25 08:50:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 08:50:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2019-11-25 08:50:44,160 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 59 [2019-11-25 08:50:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:44,162 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2019-11-25 08:50:44,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2019-11-25 08:50:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-25 08:50:44,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:44,169 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:44,170 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:44,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:44,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1630534542, now seen corresponding path program 1 times [2019-11-25 08:50:44,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:44,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126032523] [2019-11-25 08:50:44,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:44,276 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-25 08:50:44,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126032523] [2019-11-25 08:50:44,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:44,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:44,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895444836] [2019-11-25 08:50:44,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:44,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:44,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:44,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:44,283 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand 4 states. [2019-11-25 08:50:44,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:44,581 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2019-11-25 08:50:44,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:44,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-25 08:50:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:44,583 INFO L225 Difference]: With dead ends: 280 [2019-11-25 08:50:44,583 INFO L226 Difference]: Without dead ends: 156 [2019-11-25 08:50:44,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-25 08:50:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-25 08:50:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 08:50:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2019-11-25 08:50:44,597 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 60 [2019-11-25 08:50:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:44,598 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2019-11-25 08:50:44,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2019-11-25 08:50:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-25 08:50:44,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:44,600 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:44,600 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:44,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1839064698, now seen corresponding path program 1 times [2019-11-25 08:50:44,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:44,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776450509] [2019-11-25 08:50:44,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:44,677 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-25 08:50:44,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776450509] [2019-11-25 08:50:44,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:44,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:44,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131641348] [2019-11-25 08:50:44,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:44,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:44,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:44,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:44,679 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand 4 states. [2019-11-25 08:50:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:44,957 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2019-11-25 08:50:44,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:44,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-25 08:50:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:44,960 INFO L225 Difference]: With dead ends: 280 [2019-11-25 08:50:44,960 INFO L226 Difference]: Without dead ends: 156 [2019-11-25 08:50:44,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-25 08:50:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-25 08:50:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 08:50:44,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2019-11-25 08:50:44,967 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 60 [2019-11-25 08:50:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:44,967 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2019-11-25 08:50:44,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2019-11-25 08:50:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-25 08:50:44,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:44,969 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:44,969 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:44,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:44,969 INFO L82 PathProgramCache]: Analyzing trace with hash 476213239, now seen corresponding path program 1 times [2019-11-25 08:50:44,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:44,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573867162] [2019-11-25 08:50:44,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:45,042 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-25 08:50:45,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573867162] [2019-11-25 08:50:45,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:45,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:45,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077316520] [2019-11-25 08:50:45,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:45,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:45,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:45,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:45,044 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand 4 states. [2019-11-25 08:50:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:45,347 INFO L93 Difference]: Finished difference Result 280 states and 420 transitions. [2019-11-25 08:50:45,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:45,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-25 08:50:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:45,349 INFO L225 Difference]: With dead ends: 280 [2019-11-25 08:50:45,349 INFO L226 Difference]: Without dead ends: 156 [2019-11-25 08:50:45,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-25 08:50:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-25 08:50:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 08:50:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2019-11-25 08:50:45,356 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 61 [2019-11-25 08:50:45,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:45,356 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2019-11-25 08:50:45,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2019-11-25 08:50:45,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:50:45,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:45,357 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:45,357 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:45,358 INFO L82 PathProgramCache]: Analyzing trace with hash -25209675, now seen corresponding path program 1 times [2019-11-25 08:50:45,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:45,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499339043] [2019-11-25 08:50:45,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:45,409 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-25 08:50:45,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499339043] [2019-11-25 08:50:45,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:45,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:45,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956767290] [2019-11-25 08:50:45,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:45,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:45,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:45,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:45,412 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand 4 states. [2019-11-25 08:50:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:45,748 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2019-11-25 08:50:45,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:45,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-25 08:50:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:45,750 INFO L225 Difference]: With dead ends: 280 [2019-11-25 08:50:45,750 INFO L226 Difference]: Without dead ends: 156 [2019-11-25 08:50:45,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-25 08:50:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-25 08:50:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 08:50:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2019-11-25 08:50:45,756 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 62 [2019-11-25 08:50:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:45,756 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2019-11-25 08:50:45,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2019-11-25 08:50:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:50:45,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:45,757 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:45,757 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:45,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:45,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1383513241, now seen corresponding path program 1 times [2019-11-25 08:50:45,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:45,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059071495] [2019-11-25 08:50:45,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:45,855 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-25 08:50:45,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059071495] [2019-11-25 08:50:45,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:45,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:45,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023045503] [2019-11-25 08:50:45,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:45,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:45,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:45,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:45,857 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand 4 states. [2019-11-25 08:50:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:46,201 INFO L93 Difference]: Finished difference Result 310 states and 467 transitions. [2019-11-25 08:50:46,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:46,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-25 08:50:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:46,204 INFO L225 Difference]: With dead ends: 310 [2019-11-25 08:50:46,204 INFO L226 Difference]: Without dead ends: 186 [2019-11-25 08:50:46,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-25 08:50:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-11-25 08:50:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 08:50:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2019-11-25 08:50:46,210 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 62 [2019-11-25 08:50:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:46,210 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2019-11-25 08:50:46,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2019-11-25 08:50:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-25 08:50:46,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:46,211 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:46,212 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:46,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash 407848530, now seen corresponding path program 1 times [2019-11-25 08:50:46,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:46,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295881413] [2019-11-25 08:50:46,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:46,262 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-25 08:50:46,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295881413] [2019-11-25 08:50:46,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:46,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:46,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924896346] [2019-11-25 08:50:46,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:46,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:46,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:46,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:46,264 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand 4 states. [2019-11-25 08:50:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:46,527 INFO L93 Difference]: Finished difference Result 314 states and 481 transitions. [2019-11-25 08:50:46,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:46,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-25 08:50:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:46,529 INFO L225 Difference]: With dead ends: 314 [2019-11-25 08:50:46,530 INFO L226 Difference]: Without dead ends: 168 [2019-11-25 08:50:46,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-25 08:50:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2019-11-25 08:50:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 08:50:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2019-11-25 08:50:46,535 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 63 [2019-11-25 08:50:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:46,536 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2019-11-25 08:50:46,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2019-11-25 08:50:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-25 08:50:46,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:46,537 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:46,537 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1281685867, now seen corresponding path program 1 times [2019-11-25 08:50:46,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:46,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707498432] [2019-11-25 08:50:46,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:46,585 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-25 08:50:46,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707498432] [2019-11-25 08:50:46,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:46,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:46,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197941954] [2019-11-25 08:50:46,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:46,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:46,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:46,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:46,587 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand 4 states. [2019-11-25 08:50:46,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:46,951 INFO L93 Difference]: Finished difference Result 332 states and 503 transitions. [2019-11-25 08:50:46,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:46,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-25 08:50:46,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:46,954 INFO L225 Difference]: With dead ends: 332 [2019-11-25 08:50:46,954 INFO L226 Difference]: Without dead ends: 186 [2019-11-25 08:50:46,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-25 08:50:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-11-25 08:50:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 08:50:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2019-11-25 08:50:46,961 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 75 [2019-11-25 08:50:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:46,961 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2019-11-25 08:50:46,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2019-11-25 08:50:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:50:46,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:46,963 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:46,963 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:46,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash 712782694, now seen corresponding path program 1 times [2019-11-25 08:50:46,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:46,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363149838] [2019-11-25 08:50:46,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:47,023 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-25 08:50:47,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363149838] [2019-11-25 08:50:47,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:47,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:47,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801743123] [2019-11-25 08:50:47,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:47,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:47,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:47,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:47,026 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand 4 states. [2019-11-25 08:50:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:47,381 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2019-11-25 08:50:47,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:47,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:50:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:47,383 INFO L225 Difference]: With dead ends: 330 [2019-11-25 08:50:47,383 INFO L226 Difference]: Without dead ends: 184 [2019-11-25 08:50:47,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:47,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-25 08:50:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2019-11-25 08:50:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 08:50:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2019-11-25 08:50:47,390 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 76 [2019-11-25 08:50:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:47,390 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2019-11-25 08:50:47,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:47,390 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2019-11-25 08:50:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:50:47,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:47,391 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:47,391 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:47,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:47,392 INFO L82 PathProgramCache]: Analyzing trace with hash -132655702, now seen corresponding path program 1 times [2019-11-25 08:50:47,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:47,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258336775] [2019-11-25 08:50:47,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:47,440 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-25 08:50:47,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258336775] [2019-11-25 08:50:47,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:47,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:47,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193865206] [2019-11-25 08:50:47,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:47,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:47,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:47,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:47,442 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand 4 states. [2019-11-25 08:50:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:47,753 INFO L93 Difference]: Finished difference Result 329 states and 496 transitions. [2019-11-25 08:50:47,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:47,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:50:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:47,755 INFO L225 Difference]: With dead ends: 329 [2019-11-25 08:50:47,755 INFO L226 Difference]: Without dead ends: 183 [2019-11-25 08:50:47,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-25 08:50:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2019-11-25 08:50:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 08:50:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2019-11-25 08:50:47,761 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 76 [2019-11-25 08:50:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:47,761 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2019-11-25 08:50:47,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2019-11-25 08:50:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-25 08:50:47,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:47,763 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:47,763 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:47,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:47,763 INFO L82 PathProgramCache]: Analyzing trace with hash 133532868, now seen corresponding path program 1 times [2019-11-25 08:50:47,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:47,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854246855] [2019-11-25 08:50:47,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:47,812 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-25 08:50:47,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854246855] [2019-11-25 08:50:47,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:47,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:47,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666373068] [2019-11-25 08:50:47,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:47,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:47,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:47,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:47,814 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand 4 states. [2019-11-25 08:50:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:48,150 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2019-11-25 08:50:48,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:48,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-25 08:50:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:48,152 INFO L225 Difference]: With dead ends: 328 [2019-11-25 08:50:48,152 INFO L226 Difference]: Without dead ends: 182 [2019-11-25 08:50:48,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-25 08:50:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-25 08:50:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 08:50:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2019-11-25 08:50:48,157 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 77 [2019-11-25 08:50:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:48,159 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2019-11-25 08:50:48,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2019-11-25 08:50:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-25 08:50:48,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:48,160 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:48,160 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:48,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:48,161 INFO L82 PathProgramCache]: Analyzing trace with hash 342063024, now seen corresponding path program 1 times [2019-11-25 08:50:48,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:48,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221058489] [2019-11-25 08:50:48,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:48,202 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-25 08:50:48,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221058489] [2019-11-25 08:50:48,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:48,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:48,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786043412] [2019-11-25 08:50:48,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:48,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:48,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:48,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:48,205 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand 4 states. [2019-11-25 08:50:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:48,519 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2019-11-25 08:50:48,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:48,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-25 08:50:48,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:48,521 INFO L225 Difference]: With dead ends: 328 [2019-11-25 08:50:48,521 INFO L226 Difference]: Without dead ends: 182 [2019-11-25 08:50:48,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-25 08:50:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-25 08:50:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 08:50:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2019-11-25 08:50:48,527 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 77 [2019-11-25 08:50:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:48,527 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2019-11-25 08:50:48,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2019-11-25 08:50:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-25 08:50:48,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:48,529 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:48,529 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:48,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:48,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1313801601, now seen corresponding path program 1 times [2019-11-25 08:50:48,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:48,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220440166] [2019-11-25 08:50:48,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:48,569 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-25 08:50:48,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220440166] [2019-11-25 08:50:48,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:48,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:48,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405360728] [2019-11-25 08:50:48,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:48,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:48,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:48,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:48,572 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 4 states. [2019-11-25 08:50:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:48,880 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2019-11-25 08:50:48,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:48,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-25 08:50:48,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:48,882 INFO L225 Difference]: With dead ends: 328 [2019-11-25 08:50:48,882 INFO L226 Difference]: Without dead ends: 182 [2019-11-25 08:50:48,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-25 08:50:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-25 08:50:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 08:50:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2019-11-25 08:50:48,888 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 78 [2019-11-25 08:50:48,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:48,888 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2019-11-25 08:50:48,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2019-11-25 08:50:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-25 08:50:48,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:48,894 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:48,894 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:48,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:48,895 INFO L82 PathProgramCache]: Analyzing trace with hash 170225771, now seen corresponding path program 1 times [2019-11-25 08:50:48,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:48,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100260298] [2019-11-25 08:50:48,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:48,953 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-25 08:50:48,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100260298] [2019-11-25 08:50:48,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:48,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:48,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242962774] [2019-11-25 08:50:48,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:48,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:48,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:48,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:48,954 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand 4 states. [2019-11-25 08:50:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:49,275 INFO L93 Difference]: Finished difference Result 328 states and 487 transitions. [2019-11-25 08:50:49,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:49,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-25 08:50:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:49,277 INFO L225 Difference]: With dead ends: 328 [2019-11-25 08:50:49,277 INFO L226 Difference]: Without dead ends: 182 [2019-11-25 08:50:49,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:49,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-25 08:50:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-25 08:50:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 08:50:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2019-11-25 08:50:49,282 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 79 [2019-11-25 08:50:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:49,283 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2019-11-25 08:50:49,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2019-11-25 08:50:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-25 08:50:49,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:49,284 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:49,284 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:49,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:49,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2123587236, now seen corresponding path program 1 times [2019-11-25 08:50:49,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:49,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355220994] [2019-11-25 08:50:49,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:49,331 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-25 08:50:49,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355220994] [2019-11-25 08:50:49,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:49,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:49,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989569061] [2019-11-25 08:50:49,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:49,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:49,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:49,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:49,333 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand 4 states. [2019-11-25 08:50:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:49,620 INFO L93 Difference]: Finished difference Result 318 states and 472 transitions. [2019-11-25 08:50:49,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:49,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-25 08:50:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:49,621 INFO L225 Difference]: With dead ends: 318 [2019-11-25 08:50:49,622 INFO L226 Difference]: Without dead ends: 172 [2019-11-25 08:50:49,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-25 08:50:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2019-11-25 08:50:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 08:50:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2019-11-25 08:50:49,627 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 80 [2019-11-25 08:50:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:49,627 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2019-11-25 08:50:49,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2019-11-25 08:50:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:50:49,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:49,628 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:49,628 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:49,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:49,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1575477095, now seen corresponding path program 1 times [2019-11-25 08:50:49,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:49,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587596570] [2019-11-25 08:50:49,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:49,704 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-25 08:50:49,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587596570] [2019-11-25 08:50:49,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:49,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:49,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193497557] [2019-11-25 08:50:49,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:49,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:49,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:49,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:49,706 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand 4 states. [2019-11-25 08:50:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:50,117 INFO L93 Difference]: Finished difference Result 408 states and 610 transitions. [2019-11-25 08:50:50,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:50,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-25 08:50:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:50,124 INFO L225 Difference]: With dead ends: 408 [2019-11-25 08:50:50,124 INFO L226 Difference]: Without dead ends: 262 [2019-11-25 08:50:50,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-25 08:50:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2019-11-25 08:50:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-25 08:50:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2019-11-25 08:50:50,132 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 84 [2019-11-25 08:50:50,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:50,132 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2019-11-25 08:50:50,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2019-11-25 08:50:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:50:50,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:50,134 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:50,134 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:50,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:50,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1822096923, now seen corresponding path program 1 times [2019-11-25 08:50:50,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:50,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035500509] [2019-11-25 08:50:50,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:50,206 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-25 08:50:50,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035500509] [2019-11-25 08:50:50,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:50,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:50,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203764421] [2019-11-25 08:50:50,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:50,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:50,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:50,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:50,208 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand 4 states. [2019-11-25 08:50:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:50,601 INFO L93 Difference]: Finished difference Result 446 states and 691 transitions. [2019-11-25 08:50:50,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:50,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-25 08:50:50,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:50,603 INFO L225 Difference]: With dead ends: 446 [2019-11-25 08:50:50,603 INFO L226 Difference]: Without dead ends: 257 [2019-11-25 08:50:50,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-25 08:50:50,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-11-25 08:50:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 08:50:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2019-11-25 08:50:50,609 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 84 [2019-11-25 08:50:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:50,610 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2019-11-25 08:50:50,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2019-11-25 08:50:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-25 08:50:50,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:50,612 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:50,612 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:50,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:50,612 INFO L82 PathProgramCache]: Analyzing trace with hash 878453397, now seen corresponding path program 1 times [2019-11-25 08:50:50,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:50,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768243073] [2019-11-25 08:50:50,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:50,669 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-25 08:50:50,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768243073] [2019-11-25 08:50:50,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:50,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:50,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233775265] [2019-11-25 08:50:50,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:50,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:50,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:50,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:50,671 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand 4 states. [2019-11-25 08:50:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:51,122 INFO L93 Difference]: Finished difference Result 499 states and 771 transitions. [2019-11-25 08:50:51,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:51,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-25 08:50:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:51,124 INFO L225 Difference]: With dead ends: 499 [2019-11-25 08:50:51,124 INFO L226 Difference]: Without dead ends: 286 [2019-11-25 08:50:51,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-25 08:50:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2019-11-25 08:50:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 08:50:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2019-11-25 08:50:51,131 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 97 [2019-11-25 08:50:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:51,132 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2019-11-25 08:50:51,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2019-11-25 08:50:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-25 08:50:51,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:51,133 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:51,133 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:51,134 INFO L82 PathProgramCache]: Analyzing trace with hash 919128147, now seen corresponding path program 1 times [2019-11-25 08:50:51,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:51,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585703334] [2019-11-25 08:50:51,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:51,191 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-25 08:50:51,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585703334] [2019-11-25 08:50:51,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:51,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:51,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578987206] [2019-11-25 08:50:51,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:51,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:51,193 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand 4 states. [2019-11-25 08:50:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:51,547 INFO L93 Difference]: Finished difference Result 470 states and 730 transitions. [2019-11-25 08:50:51,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:51,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-25 08:50:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:51,550 INFO L225 Difference]: With dead ends: 470 [2019-11-25 08:50:51,550 INFO L226 Difference]: Without dead ends: 257 [2019-11-25 08:50:51,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-25 08:50:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-11-25 08:50:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 08:50:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2019-11-25 08:50:51,556 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 97 [2019-11-25 08:50:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:51,556 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2019-11-25 08:50:51,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2019-11-25 08:50:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:50:51,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:51,557 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:51,557 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:51,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1042376858, now seen corresponding path program 1 times [2019-11-25 08:50:51,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:51,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025478183] [2019-11-25 08:50:51,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:51,625 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-25 08:50:51,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025478183] [2019-11-25 08:50:51,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:51,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:51,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964597724] [2019-11-25 08:50:51,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:51,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:51,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:51,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:51,628 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 4 states. [2019-11-25 08:50:52,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:52,053 INFO L93 Difference]: Finished difference Result 497 states and 765 transitions. [2019-11-25 08:50:52,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:52,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:50:52,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:52,056 INFO L225 Difference]: With dead ends: 497 [2019-11-25 08:50:52,056 INFO L226 Difference]: Without dead ends: 284 [2019-11-25 08:50:52,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-25 08:50:52,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2019-11-25 08:50:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 08:50:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2019-11-25 08:50:52,063 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 98 [2019-11-25 08:50:52,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:52,063 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2019-11-25 08:50:52,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2019-11-25 08:50:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:50:52,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:52,065 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:52,065 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:52,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1887815254, now seen corresponding path program 1 times [2019-11-25 08:50:52,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:52,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670336418] [2019-11-25 08:50:52,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:52,133 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-25 08:50:52,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670336418] [2019-11-25 08:50:52,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:52,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:52,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738609346] [2019-11-25 08:50:52,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:52,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:52,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:52,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:52,136 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand 4 states. [2019-11-25 08:50:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:52,595 INFO L93 Difference]: Finished difference Result 496 states and 762 transitions. [2019-11-25 08:50:52,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:52,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:50:52,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:52,597 INFO L225 Difference]: With dead ends: 496 [2019-11-25 08:50:52,597 INFO L226 Difference]: Without dead ends: 283 [2019-11-25 08:50:52,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:52,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-25 08:50:52,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2019-11-25 08:50:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 08:50:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2019-11-25 08:50:52,606 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 98 [2019-11-25 08:50:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:52,606 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2019-11-25 08:50:52,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2019-11-25 08:50:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:50:52,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:52,608 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:52,608 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:52,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:52,609 INFO L82 PathProgramCache]: Analyzing trace with hash 218540392, now seen corresponding path program 1 times [2019-11-25 08:50:52,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:52,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564060080] [2019-11-25 08:50:52,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:52,674 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-25 08:50:52,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564060080] [2019-11-25 08:50:52,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:52,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:52,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493923675] [2019-11-25 08:50:52,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:52,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:52,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:52,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:52,676 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand 4 states. [2019-11-25 08:50:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:53,023 INFO L93 Difference]: Finished difference Result 468 states and 722 transitions. [2019-11-25 08:50:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:53,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:50:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:53,025 INFO L225 Difference]: With dead ends: 468 [2019-11-25 08:50:53,025 INFO L226 Difference]: Without dead ends: 255 [2019-11-25 08:50:53,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-25 08:50:53,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 232. [2019-11-25 08:50:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 08:50:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2019-11-25 08:50:53,031 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 98 [2019-11-25 08:50:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:53,031 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2019-11-25 08:50:53,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2019-11-25 08:50:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:50:53,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:53,033 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:53,033 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:53,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash -626898004, now seen corresponding path program 1 times [2019-11-25 08:50:53,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:53,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75660518] [2019-11-25 08:50:53,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:53,116 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-25 08:50:53,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75660518] [2019-11-25 08:50:53,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:53,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:53,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31459580] [2019-11-25 08:50:53,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:53,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:53,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:53,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:53,142 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand 4 states. [2019-11-25 08:50:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:53,493 INFO L93 Difference]: Finished difference Result 467 states and 719 transitions. [2019-11-25 08:50:53,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:53,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:50:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:53,495 INFO L225 Difference]: With dead ends: 467 [2019-11-25 08:50:53,495 INFO L226 Difference]: Without dead ends: 254 [2019-11-25 08:50:53,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:53,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-25 08:50:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2019-11-25 08:50:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 08:50:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 355 transitions. [2019-11-25 08:50:53,501 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 355 transitions. Word has length 98 [2019-11-25 08:50:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:53,501 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 355 transitions. [2019-11-25 08:50:53,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 355 transitions. [2019-11-25 08:50:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:50:53,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:53,502 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:53,502 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:53,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1558161604, now seen corresponding path program 1 times [2019-11-25 08:50:53,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:53,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141173483] [2019-11-25 08:50:53,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:53,553 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-25 08:50:53,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141173483] [2019-11-25 08:50:53,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:53,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:53,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660176377] [2019-11-25 08:50:53,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:53,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:53,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:53,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:53,555 INFO L87 Difference]: Start difference. First operand 232 states and 355 transitions. Second operand 4 states. [2019-11-25 08:50:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:53,963 INFO L93 Difference]: Finished difference Result 495 states and 755 transitions. [2019-11-25 08:50:53,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:53,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-25 08:50:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:53,965 INFO L225 Difference]: With dead ends: 495 [2019-11-25 08:50:53,965 INFO L226 Difference]: Without dead ends: 282 [2019-11-25 08:50:53,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-25 08:50:53,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-11-25 08:50:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 08:50:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 354 transitions. [2019-11-25 08:50:53,971 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 354 transitions. Word has length 99 [2019-11-25 08:50:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:53,971 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 354 transitions. [2019-11-25 08:50:53,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:53,971 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 354 transitions. [2019-11-25 08:50:53,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:50:53,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:53,972 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:53,972 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:53,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1766691760, now seen corresponding path program 1 times [2019-11-25 08:50:53,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:53,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777386402] [2019-11-25 08:50:53,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:54,047 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-25 08:50:54,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777386402] [2019-11-25 08:50:54,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:54,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:54,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324498326] [2019-11-25 08:50:54,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:54,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:54,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:54,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:54,049 INFO L87 Difference]: Start difference. First operand 232 states and 354 transitions. Second operand 5 states. [2019-11-25 08:50:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:54,486 INFO L93 Difference]: Finished difference Result 466 states and 716 transitions. [2019-11-25 08:50:54,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:50:54,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-25 08:50:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:54,488 INFO L225 Difference]: With dead ends: 466 [2019-11-25 08:50:54,488 INFO L226 Difference]: Without dead ends: 253 [2019-11-25 08:50:54,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-25 08:50:54,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-11-25 08:50:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-25 08:50:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2019-11-25 08:50:54,494 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 99 [2019-11-25 08:50:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:54,495 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2019-11-25 08:50:54,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2019-11-25 08:50:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:50:54,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:54,496 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:54,496 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:54,496 INFO L82 PathProgramCache]: Analyzing trace with hash -907239660, now seen corresponding path program 1 times [2019-11-25 08:50:54,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:54,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191057052] [2019-11-25 08:50:54,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:54,554 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-25 08:50:54,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191057052] [2019-11-25 08:50:54,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:54,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:54,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632234054] [2019-11-25 08:50:54,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:54,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:54,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:54,556 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand 4 states. [2019-11-25 08:50:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:54,910 INFO L93 Difference]: Finished difference Result 535 states and 804 transitions. [2019-11-25 08:50:54,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:54,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:50:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:54,912 INFO L225 Difference]: With dead ends: 535 [2019-11-25 08:50:54,912 INFO L226 Difference]: Without dead ends: 302 [2019-11-25 08:50:54,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-25 08:50:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-11-25 08:50:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-25 08:50:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2019-11-25 08:50:54,926 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 100 [2019-11-25 08:50:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:54,927 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2019-11-25 08:50:54,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2019-11-25 08:50:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:50:54,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:54,928 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:54,928 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:54,929 INFO L82 PathProgramCache]: Analyzing trace with hash -346539882, now seen corresponding path program 1 times [2019-11-25 08:50:54,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:54,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997647787] [2019-11-25 08:50:54,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:54,988 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-25 08:50:54,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997647787] [2019-11-25 08:50:54,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:54,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:54,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259873642] [2019-11-25 08:50:54,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:54,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:54,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:54,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:54,990 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand 4 states. [2019-11-25 08:50:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:55,309 INFO L93 Difference]: Finished difference Result 506 states and 763 transitions. [2019-11-25 08:50:55,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:55,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:50:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:55,312 INFO L225 Difference]: With dead ends: 506 [2019-11-25 08:50:55,312 INFO L226 Difference]: Without dead ends: 273 [2019-11-25 08:50:55,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-25 08:50:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-25 08:50:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-25 08:50:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2019-11-25 08:50:55,320 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 100 [2019-11-25 08:50:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:55,321 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2019-11-25 08:50:55,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2019-11-25 08:50:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:50:55,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:55,322 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:55,322 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:55,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:55,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1206682467, now seen corresponding path program 1 times [2019-11-25 08:50:55,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:55,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284832436] [2019-11-25 08:50:55,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:55,387 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-25 08:50:55,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284832436] [2019-11-25 08:50:55,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:55,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:55,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630082613] [2019-11-25 08:50:55,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:55,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:55,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:55,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:55,389 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand 4 states. [2019-11-25 08:50:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:55,799 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2019-11-25 08:50:55,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:55,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-25 08:50:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:55,801 INFO L225 Difference]: With dead ends: 535 [2019-11-25 08:50:55,801 INFO L226 Difference]: Without dead ends: 302 [2019-11-25 08:50:55,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-25 08:50:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-11-25 08:50:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-25 08:50:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2019-11-25 08:50:55,832 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 101 [2019-11-25 08:50:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:55,833 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2019-11-25 08:50:55,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2019-11-25 08:50:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:50:55,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:55,834 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:55,834 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:55,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1408506401, now seen corresponding path program 1 times [2019-11-25 08:50:55,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:55,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475195501] [2019-11-25 08:50:55,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:55,886 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-25 08:50:55,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475195501] [2019-11-25 08:50:55,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:55,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:55,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412915408] [2019-11-25 08:50:55,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:55,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:55,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:55,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:55,888 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand 4 states. [2019-11-25 08:50:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:56,162 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2019-11-25 08:50:56,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:56,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-25 08:50:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:56,164 INFO L225 Difference]: With dead ends: 506 [2019-11-25 08:50:56,164 INFO L226 Difference]: Without dead ends: 273 [2019-11-25 08:50:56,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-25 08:50:56,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-25 08:50:56,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-25 08:50:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2019-11-25 08:50:56,171 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 101 [2019-11-25 08:50:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:56,171 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2019-11-25 08:50:56,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2019-11-25 08:50:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:50:56,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:56,172 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:56,172 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:56,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash -610222663, now seen corresponding path program 1 times [2019-11-25 08:50:56,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:56,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718923565] [2019-11-25 08:50:56,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:56,230 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-25 08:50:56,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718923565] [2019-11-25 08:50:56,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:56,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:56,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680643127] [2019-11-25 08:50:56,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:56,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:56,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:56,232 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand 4 states. [2019-11-25 08:50:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:56,611 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2019-11-25 08:50:56,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:56,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-25 08:50:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:56,614 INFO L225 Difference]: With dead ends: 535 [2019-11-25 08:50:56,614 INFO L226 Difference]: Without dead ends: 302 [2019-11-25 08:50:56,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-25 08:50:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-11-25 08:50:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-25 08:50:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2019-11-25 08:50:56,621 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 102 [2019-11-25 08:50:56,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:56,621 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2019-11-25 08:50:56,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2019-11-25 08:50:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:50:56,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:56,625 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:56,625 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:56,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:56,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1351351995, now seen corresponding path program 1 times [2019-11-25 08:50:56,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:56,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127781404] [2019-11-25 08:50:56,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:56,678 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-25 08:50:56,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127781404] [2019-11-25 08:50:56,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:56,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:56,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847723267] [2019-11-25 08:50:56,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:56,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:56,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:56,679 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand 4 states. [2019-11-25 08:50:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:56,999 INFO L93 Difference]: Finished difference Result 506 states and 755 transitions. [2019-11-25 08:50:57,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:57,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-25 08:50:57,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:57,002 INFO L225 Difference]: With dead ends: 506 [2019-11-25 08:50:57,002 INFO L226 Difference]: Without dead ends: 273 [2019-11-25 08:50:57,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-25 08:50:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-25 08:50:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-25 08:50:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2019-11-25 08:50:57,009 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 102 [2019-11-25 08:50:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:57,009 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2019-11-25 08:50:57,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2019-11-25 08:50:57,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-25 08:50:57,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:57,010 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:57,010 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:57,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:57,011 INFO L82 PathProgramCache]: Analyzing trace with hash 271278824, now seen corresponding path program 1 times [2019-11-25 08:50:57,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:57,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714913967] [2019-11-25 08:50:57,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:57,061 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-25 08:50:57,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714913967] [2019-11-25 08:50:57,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:57,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:57,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843830173] [2019-11-25 08:50:57,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:57,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:57,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:57,063 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand 4 states. [2019-11-25 08:50:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:57,422 INFO L93 Difference]: Finished difference Result 525 states and 780 transitions. [2019-11-25 08:50:57,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:57,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-25 08:50:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:57,425 INFO L225 Difference]: With dead ends: 525 [2019-11-25 08:50:57,425 INFO L226 Difference]: Without dead ends: 292 [2019-11-25 08:50:57,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-25 08:50:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-11-25 08:50:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-25 08:50:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2019-11-25 08:50:57,432 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 103 [2019-11-25 08:50:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:57,432 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2019-11-25 08:50:57,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2019-11-25 08:50:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-25 08:50:57,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:57,434 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:57,434 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:57,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:57,434 INFO L82 PathProgramCache]: Analyzing trace with hash 950551078, now seen corresponding path program 1 times [2019-11-25 08:50:57,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:57,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643746682] [2019-11-25 08:50:57,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:57,489 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-25 08:50:57,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643746682] [2019-11-25 08:50:57,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:57,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:57,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391997766] [2019-11-25 08:50:57,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:57,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:57,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:57,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:57,490 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand 4 states. [2019-11-25 08:50:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:57,796 INFO L93 Difference]: Finished difference Result 496 states and 739 transitions. [2019-11-25 08:50:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:57,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-25 08:50:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:57,798 INFO L225 Difference]: With dead ends: 496 [2019-11-25 08:50:57,798 INFO L226 Difference]: Without dead ends: 263 [2019-11-25 08:50:57,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-25 08:50:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2019-11-25 08:50:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-25 08:50:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2019-11-25 08:50:57,804 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 103 [2019-11-25 08:50:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:57,805 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2019-11-25 08:50:57,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2019-11-25 08:50:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:50:57,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:57,806 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:57,806 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:57,806 INFO L82 PathProgramCache]: Analyzing trace with hash -504345715, now seen corresponding path program 1 times [2019-11-25 08:50:57,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:57,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958758393] [2019-11-25 08:50:57,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:57,871 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-25 08:50:57,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958758393] [2019-11-25 08:50:57,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:57,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:57,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862362778] [2019-11-25 08:50:57,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:57,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:57,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:57,874 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand 4 states. [2019-11-25 08:50:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:58,276 INFO L93 Difference]: Finished difference Result 525 states and 776 transitions. [2019-11-25 08:50:58,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:58,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-25 08:50:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:58,278 INFO L225 Difference]: With dead ends: 525 [2019-11-25 08:50:58,278 INFO L226 Difference]: Without dead ends: 292 [2019-11-25 08:50:58,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:58,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-25 08:50:58,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-11-25 08:50:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-25 08:50:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2019-11-25 08:50:58,287 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 106 [2019-11-25 08:50:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:58,288 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2019-11-25 08:50:58,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2019-11-25 08:50:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:50:58,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:58,289 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:58,290 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:58,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2104441743, now seen corresponding path program 1 times [2019-11-25 08:50:58,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:58,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761531024] [2019-11-25 08:50:58,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:58,355 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-25 08:50:58,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761531024] [2019-11-25 08:50:58,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:58,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:58,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123588253] [2019-11-25 08:50:58,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:58,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:58,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:58,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:58,358 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand 3 states. [2019-11-25 08:50:58,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:58,397 INFO L93 Difference]: Finished difference Result 716 states and 1068 transitions. [2019-11-25 08:50:58,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:58,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-25 08:50:58,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:58,400 INFO L225 Difference]: With dead ends: 716 [2019-11-25 08:50:58,401 INFO L226 Difference]: Without dead ends: 483 [2019-11-25 08:50:58,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-25 08:50:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-11-25 08:50:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-25 08:50:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 716 transitions. [2019-11-25 08:50:58,417 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 716 transitions. Word has length 106 [2019-11-25 08:50:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:58,418 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 716 transitions. [2019-11-25 08:50:58,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 716 transitions. [2019-11-25 08:50:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-25 08:50:58,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:58,420 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-25 08:50:58,420 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:58,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1080065455, now seen corresponding path program 1 times [2019-11-25 08:50:58,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:58,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855724018] [2019-11-25 08:50:58,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-25 08:50:58,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855724018] [2019-11-25 08:50:58,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:58,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:58,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813922587] [2019-11-25 08:50:58,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:58,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:58,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:58,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:58,498 INFO L87 Difference]: Start difference. First operand 483 states and 716 transitions. Second operand 3 states. [2019-11-25 08:50:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:58,588 INFO L93 Difference]: Finished difference Result 947 states and 1410 transitions. [2019-11-25 08:50:58,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:58,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-25 08:50:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:58,591 INFO L225 Difference]: With dead ends: 947 [2019-11-25 08:50:58,591 INFO L226 Difference]: Without dead ends: 483 [2019-11-25 08:50:58,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-25 08:50:58,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-11-25 08:50:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-25 08:50:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 711 transitions. [2019-11-25 08:50:58,605 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 711 transitions. Word has length 125 [2019-11-25 08:50:58,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:58,605 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 711 transitions. [2019-11-25 08:50:58,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 711 transitions. [2019-11-25 08:50:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-25 08:50:58,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:58,607 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-25 08:50:58,607 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:58,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:58,607 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-11-25 08:50:58,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:58,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756565264] [2019-11-25 08:50:58,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:58,917 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:58,919 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:50:59,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:50:59 BoogieIcfgContainer [2019-11-25 08:50:59,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:50:59,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:50:59,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:50:59,070 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:50:59,071 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:41" (3/4) ... [2019-11-25 08:50:59,082 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:50:59,093 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:50:59,095 INFO L168 Benchmark]: Toolchain (without parser) took 20013.50 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.1 MB). Free memory was 940.7 MB in the beginning and 1.3 GB in the end (delta: -352.7 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:59,095 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:59,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:59,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.97 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-25 08:50:59,096 INFO L168 Benchmark]: Boogie Preprocessor took 113.73 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-25 08:50:59,097 INFO L168 Benchmark]: RCFGBuilder took 1480.91 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: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:59,097 INFO L168 Benchmark]: TraceAbstraction took 17518.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -280.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:59,097 INFO L168 Benchmark]: Witness Printer took 23.35 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:59,099 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 763.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.97 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 113.73 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 1480.91 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: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17518.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -280.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 23.35 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1706]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1120. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={7: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)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={7:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={7:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={7:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={7:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={7:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={7:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={7:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={7:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={7:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={7:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={7:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={7:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1228] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={7:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={7:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={7:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={7:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={7:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={7:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: UNSAFE, OverallTime: 17.4s, OverallIterations: 40, TraceHistogramMax: 4, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7567 SDtfs, 2263 SDslu, 11017 SDs, 0 SdLazy, 6888 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 78 SyntacticMatches, 29 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 933 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3434 NumberOfCodeBlocks, 3434 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3269 ConstructedInterpolants, 0 QuantifiedInterpolants, 765446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 1667/1667 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-6b5699a [2019-11-25 08:51:01,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:51:01,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:51:01,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:51:01,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:51:01,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:51:01,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:51:01,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:51:01,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:51:01,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:51:01,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:51:01,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:51:01,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:51:01,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:51:01,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:51:01,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:51:01,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:51:01,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:51:01,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:51:01,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:51:01,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:51:01,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:51:01,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:51:01,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:51:01,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:51:01,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:51:01,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:51:01,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:51:01,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:51:01,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:51:01,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:51:01,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:51:01,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:51:01,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:51:01,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:51:01,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:51:01,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:51:01,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:51:01,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:51:01,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:51:01,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:51:01,114 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:51:01,128 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:51:01,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:51:01,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:51:01,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:51:01,129 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:51:01,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:51:01,130 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:51:01,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:51:01,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:51:01,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:51:01,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:51:01,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:51:01,132 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:51:01,132 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:51:01,132 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:51:01,132 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:51:01,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:51:01,133 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:51:01,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:51:01,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:51:01,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:51:01,134 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:51:01,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:51:01,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:51:01,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:51:01,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:51:01,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:51:01,135 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:51:01,136 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:51:01,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:51:01,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:51:01,136 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_a210a84f-f0fc-4f29-8cd3-b04625513650/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 -> 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 [2019-11-25 08:51:01,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:51:01,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:51:01,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:51:01,402 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:51:01,402 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:51:01,403 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-25 08:51:01,454 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/data/6a859f2fd/efb2977ec4124184bb776527d47f291b/FLAG7112c328e [2019-11-25 08:51:01,933 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:51:01,933 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-25 08:51:01,949 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/data/6a859f2fd/efb2977ec4124184bb776527d47f291b/FLAG7112c328e [2019-11-25 08:51:02,173 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a210a84f-f0fc-4f29-8cd3-b04625513650/bin/uautomizer/data/6a859f2fd/efb2977ec4124184bb776527d47f291b [2019-11-25 08:51:02,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:51:02,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:51:02,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:51:02,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:51:02,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:51:02,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:51:02" (1/1) ... [2019-11-25 08:51:02,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17becd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:02, skipping insertion in model container [2019-11-25 08:51:02,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:51:02" (1/1) ... [2019-11-25 08:51:02,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:51:02,262 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:51:02,645 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-25 08:51:02,646 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-25 08:51:02,646 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:51:02,679 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: Unsupported type(() : VOID) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:955) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:700) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1300) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3448) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2263) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) 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-25 08:51:02,686 INFO L168 Benchmark]: Toolchain (without parser) took 508.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -208.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:02,687 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:51:02,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -208.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:02,691 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 505.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -208.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: Unsupported type(() : VOID): de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...