./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.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_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/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 6b059dfef9f85366fcaeddec812cf96c32b1df0d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/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 6b059dfef9f85366fcaeddec812cf96c32b1df0d ................................................................................................................................................................. 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:49:54,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:49:54,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:49:54,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:49:54,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:49:54,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:49:54,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:49:54,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:49:54,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:49:54,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:49:54,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:49:54,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:49:54,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:49:54,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:49:54,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:49:54,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:49:54,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:49:54,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:49:54,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:49:54,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:49:54,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:49:54,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:49:54,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:49:54,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:49:54,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:49:54,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:49:54,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:49:54,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:49:54,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:49:54,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:49:54,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:49:54,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:49:54,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:49:54,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:49:54,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:49:54,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:49:54,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:49:54,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:49:54,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:49:54,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:49:54,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:49:54,307 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:49:54,331 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:49:54,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:49:54,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:49:54,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:49:54,343 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:49:54,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:49:54,343 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:49:54,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:49:54,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:49:54,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:49:54,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:49:54,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:49:54,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:49:54,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:49:54,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:49:54,345 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:49:54,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:49:54,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:49:54,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:49:54,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:49:54,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:49:54,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:54,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:49:54,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:49:54,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:49:54,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:49:54,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:49:54,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:49:54,347 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_9f5acf52-db58-4162-b5c7-9f805c746aba/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 -> 6b059dfef9f85366fcaeddec812cf96c32b1df0d [2019-11-25 08:49:54,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:49:54,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:49:54,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:49:54,489 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:49:54,490 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:49:54,490 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-11-25 08:49:54,538 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/data/9a05521dc/e132a28571b5454d9b0b48d218b71dcc/FLAG95c54240e [2019-11-25 08:49:55,062 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:49:55,063 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-11-25 08:49:55,087 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/data/9a05521dc/e132a28571b5454d9b0b48d218b71dcc/FLAG95c54240e [2019-11-25 08:49:55,380 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/data/9a05521dc/e132a28571b5454d9b0b48d218b71dcc [2019-11-25 08:49:55,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:49:55,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:49:55,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:55,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:49:55,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:49:55,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:55" (1/1) ... [2019-11-25 08:49:55,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e3fa82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:55, skipping insertion in model container [2019-11-25 08:49:55,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:55" (1/1) ... [2019-11-25 08:49:55,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:49:55,452 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:49:55,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:55,967 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:49:56,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:56,138 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:49:56,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:56 WrapperNode [2019-11-25 08:49:56,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:56,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:56,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:49:56,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:49:56,147 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:49:56" (1/1) ... [2019-11-25 08:49:56,181 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:49:56" (1/1) ... [2019-11-25 08:49:56,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:56,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:49:56,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:49:56,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:49:56,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:56" (1/1) ... [2019-11-25 08:49:56,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:56" (1/1) ... [2019-11-25 08:49:56,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:56" (1/1) ... [2019-11-25 08:49:56,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:56" (1/1) ... [2019-11-25 08:49:56,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:56" (1/1) ... [2019-11-25 08:49:56,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:56" (1/1) ... [2019-11-25 08:49:56,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:56" (1/1) ... [2019-11-25 08:49:56,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:49:56,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:49:56,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:49:56,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:49:56,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/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:49:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:49:56,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:49:56,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:49:56,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:49:56,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:49:56,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:49:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:49:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:49:56,726 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:49:57,455 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-25 08:49:57,455 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-25 08:49:57,457 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:49:57,457 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:49:57,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:57 BoogieIcfgContainer [2019-11-25 08:49:57,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:49:57,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:49:57,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:49:57,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:49:57,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:49:55" (1/3) ... [2019-11-25 08:49:57,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343e68d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:57, skipping insertion in model container [2019-11-25 08:49:57,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:56" (2/3) ... [2019-11-25 08:49:57,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343e68d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:57, skipping insertion in model container [2019-11-25 08:49:57,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:57" (3/3) ... [2019-11-25 08:49:57,467 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2019-11-25 08:49:57,475 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:49:57,481 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:49:57,491 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:49:57,515 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:49:57,515 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:49:57,515 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:49:57,515 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:49:57,515 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:49:57,515 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:49:57,515 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:49:57,516 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:49:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-11-25 08:49:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:49:57,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:57,543 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] [2019-11-25 08:49:57,543 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2019-11-25 08:49:57,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:57,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278721922] [2019-11-25 08:49:57,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:57,838 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:49:57,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278721922] [2019-11-25 08:49:57,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:57,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:57,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440481120] [2019-11-25 08:49:57,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:57,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:57,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:57,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:57,856 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2019-11-25 08:49:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:58,205 INFO L93 Difference]: Finished difference Result 259 states and 432 transitions. [2019-11-25 08:49:58,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:58,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-25 08:49:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:58,217 INFO L225 Difference]: With dead ends: 259 [2019-11-25 08:49:58,218 INFO L226 Difference]: Without dead ends: 118 [2019-11-25 08:49:58,221 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:49:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-25 08:49:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-11-25 08:49:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-25 08:49:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2019-11-25 08:49:58,279 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 24 [2019-11-25 08:49:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:58,279 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2019-11-25 08:49:58,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2019-11-25 08:49:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 08:49:58,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:58,284 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] [2019-11-25 08:49:58,284 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:58,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1411658380, now seen corresponding path program 1 times [2019-11-25 08:49:58,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:58,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485387724] [2019-11-25 08:49:58,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:49:58,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485387724] [2019-11-25 08:49:58,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:58,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:58,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219062341] [2019-11-25 08:49:58,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:58,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:58,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:58,472 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand 3 states. [2019-11-25 08:49:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:58,512 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2019-11-25 08:49:58,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:58,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-25 08:49:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:58,515 INFO L225 Difference]: With dead ends: 327 [2019-11-25 08:49:58,515 INFO L226 Difference]: Without dead ends: 220 [2019-11-25 08:49:58,517 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:49:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-25 08:49:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-11-25 08:49:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-25 08:49:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 324 transitions. [2019-11-25 08:49:58,533 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 324 transitions. Word has length 39 [2019-11-25 08:49:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:58,533 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 324 transitions. [2019-11-25 08:49:58,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 324 transitions. [2019-11-25 08:49:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-25 08:49:58,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:58,537 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:49:58,537 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:58,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:58,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1352249408, now seen corresponding path program 1 times [2019-11-25 08:49:58,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:58,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961641141] [2019-11-25 08:49:58,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:49:58,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961641141] [2019-11-25 08:49:58,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:58,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:58,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109096041] [2019-11-25 08:49:58,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:58,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:58,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:58,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:58,669 INFO L87 Difference]: Start difference. First operand 220 states and 324 transitions. Second operand 3 states. [2019-11-25 08:49:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:58,747 INFO L93 Difference]: Finished difference Result 429 states and 639 transitions. [2019-11-25 08:49:58,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:58,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-25 08:49:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:58,752 INFO L225 Difference]: With dead ends: 429 [2019-11-25 08:49:58,752 INFO L226 Difference]: Without dead ends: 322 [2019-11-25 08:49:58,753 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:49:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-25 08:49:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-11-25 08:49:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-25 08:49:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 473 transitions. [2019-11-25 08:49:58,786 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 473 transitions. Word has length 54 [2019-11-25 08:49:58,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:58,787 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 473 transitions. [2019-11-25 08:49:58,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 473 transitions. [2019-11-25 08:49:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-25 08:49:58,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:58,792 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:58,792 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:58,792 INFO L82 PathProgramCache]: Analyzing trace with hash 210697016, now seen corresponding path program 1 times [2019-11-25 08:49:58,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:58,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179733430] [2019-11-25 08:49:58,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:49:58,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179733430] [2019-11-25 08:49:58,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:58,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:58,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76742990] [2019-11-25 08:49:58,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:58,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:58,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:58,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:58,937 INFO L87 Difference]: Start difference. First operand 322 states and 473 transitions. Second operand 4 states. [2019-11-25 08:49:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:59,481 INFO L93 Difference]: Finished difference Result 822 states and 1213 transitions. [2019-11-25 08:49:59,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:59,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-25 08:49:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:59,486 INFO L225 Difference]: With dead ends: 822 [2019-11-25 08:49:59,486 INFO L226 Difference]: Without dead ends: 510 [2019-11-25 08:49:59,488 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:49:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-25 08:49:59,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 372. [2019-11-25 08:49:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-25 08:49:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 559 transitions. [2019-11-25 08:49:59,511 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 559 transitions. Word has length 72 [2019-11-25 08:49:59,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:59,512 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 559 transitions. [2019-11-25 08:49:59,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 559 transitions. [2019-11-25 08:49:59,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-25 08:49:59,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:59,517 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:59,517 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:59,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:59,517 INFO L82 PathProgramCache]: Analyzing trace with hash 76683510, now seen corresponding path program 1 times [2019-11-25 08:49:59,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:59,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207993448] [2019-11-25 08:49:59,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:49:59,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207993448] [2019-11-25 08:49:59,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:59,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:59,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254124865] [2019-11-25 08:49:59,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:59,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:59,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:59,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:59,618 INFO L87 Difference]: Start difference. First operand 372 states and 559 transitions. Second operand 4 states. [2019-11-25 08:50:00,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:00,067 INFO L93 Difference]: Finished difference Result 818 states and 1229 transitions. [2019-11-25 08:50:00,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:00,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-25 08:50:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:00,071 INFO L225 Difference]: With dead ends: 818 [2019-11-25 08:50:00,071 INFO L226 Difference]: Without dead ends: 456 [2019-11-25 08:50:00,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-25 08:50:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 412. [2019-11-25 08:50:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-25 08:50:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 627 transitions. [2019-11-25 08:50:00,085 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 627 transitions. Word has length 72 [2019-11-25 08:50:00,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:00,085 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 627 transitions. [2019-11-25 08:50:00,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:00,085 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 627 transitions. [2019-11-25 08:50:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-25 08:50:00,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:00,089 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:00,090 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:00,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2062745025, now seen corresponding path program 1 times [2019-11-25 08:50:00,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:00,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108378726] [2019-11-25 08:50:00,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:00,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108378726] [2019-11-25 08:50:00,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:00,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:00,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80947579] [2019-11-25 08:50:00,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:00,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:00,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:00,170 INFO L87 Difference]: Start difference. First operand 412 states and 627 transitions. Second operand 4 states. [2019-11-25 08:50:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:00,703 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2019-11-25 08:50:00,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:00,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-25 08:50:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:00,709 INFO L225 Difference]: With dead ends: 946 [2019-11-25 08:50:00,710 INFO L226 Difference]: Without dead ends: 544 [2019-11-25 08:50:00,711 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:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-11-25 08:50:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 414. [2019-11-25 08:50:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-25 08:50:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 629 transitions. [2019-11-25 08:50:00,730 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 629 transitions. Word has length 73 [2019-11-25 08:50:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:00,731 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 629 transitions. [2019-11-25 08:50:00,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 629 transitions. [2019-11-25 08:50:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-25 08:50:00,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:00,735 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:00,735 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:00,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:00,735 INFO L82 PathProgramCache]: Analyzing trace with hash 475156595, now seen corresponding path program 1 times [2019-11-25 08:50:00,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:00,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455717692] [2019-11-25 08:50:00,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:00,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455717692] [2019-11-25 08:50:00,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:00,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:00,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888612407] [2019-11-25 08:50:00,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:00,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:00,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:00,864 INFO L87 Difference]: Start difference. First operand 414 states and 629 transitions. Second operand 4 states. [2019-11-25 08:50:01,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:01,396 INFO L93 Difference]: Finished difference Result 948 states and 1426 transitions. [2019-11-25 08:50:01,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:01,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-25 08:50:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:01,400 INFO L225 Difference]: With dead ends: 948 [2019-11-25 08:50:01,400 INFO L226 Difference]: Without dead ends: 544 [2019-11-25 08:50:01,401 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:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-11-25 08:50:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 416. [2019-11-25 08:50:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-25 08:50:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 631 transitions. [2019-11-25 08:50:01,416 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 631 transitions. Word has length 74 [2019-11-25 08:50:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:01,416 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 631 transitions. [2019-11-25 08:50:01,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 631 transitions. [2019-11-25 08:50:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-25 08:50:01,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:01,418 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:01,418 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:01,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1840475418, now seen corresponding path program 1 times [2019-11-25 08:50:01,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:01,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937127952] [2019-11-25 08:50:01,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:01,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937127952] [2019-11-25 08:50:01,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:01,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:01,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728807889] [2019-11-25 08:50:01,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:01,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:01,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:01,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:01,533 INFO L87 Difference]: Start difference. First operand 416 states and 631 transitions. Second operand 4 states. [2019-11-25 08:50:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:02,137 INFO L93 Difference]: Finished difference Result 940 states and 1414 transitions. [2019-11-25 08:50:02,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:02,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-25 08:50:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:02,142 INFO L225 Difference]: With dead ends: 940 [2019-11-25 08:50:02,142 INFO L226 Difference]: Without dead ends: 534 [2019-11-25 08:50:02,143 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:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-11-25 08:50:02,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 418. [2019-11-25 08:50:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 633 transitions. [2019-11-25 08:50:02,155 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 633 transitions. Word has length 75 [2019-11-25 08:50:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:02,155 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 633 transitions. [2019-11-25 08:50:02,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 633 transitions. [2019-11-25 08:50:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:50:02,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:02,158 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:02,158 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1935805867, now seen corresponding path program 2 times [2019-11-25 08:50:02,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:02,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721319540] [2019-11-25 08:50:02,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:02,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721319540] [2019-11-25 08:50:02,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:02,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:02,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611227226] [2019-11-25 08:50:02,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:02,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:02,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:02,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:02,245 INFO L87 Difference]: Start difference. First operand 418 states and 633 transitions. Second operand 4 states. [2019-11-25 08:50:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:02,723 INFO L93 Difference]: Finished difference Result 940 states and 1412 transitions. [2019-11-25 08:50:02,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:02,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:50:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:02,727 INFO L225 Difference]: With dead ends: 940 [2019-11-25 08:50:02,727 INFO L226 Difference]: Without dead ends: 532 [2019-11-25 08:50:02,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:02,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-25 08:50:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-11-25 08:50:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 631 transitions. [2019-11-25 08:50:02,740 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 631 transitions. Word has length 87 [2019-11-25 08:50:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:02,740 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 631 transitions. [2019-11-25 08:50:02,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 631 transitions. [2019-11-25 08:50:02,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:50:02,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:02,748 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:02,748 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:02,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:02,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1954461325, now seen corresponding path program 1 times [2019-11-25 08:50:02,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:02,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187766257] [2019-11-25 08:50:02,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:02,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187766257] [2019-11-25 08:50:02,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:02,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:02,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632202761] [2019-11-25 08:50:02,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:02,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:02,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:02,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:02,830 INFO L87 Difference]: Start difference. First operand 418 states and 631 transitions. Second operand 4 states. [2019-11-25 08:50:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:03,355 INFO L93 Difference]: Finished difference Result 940 states and 1408 transitions. [2019-11-25 08:50:03,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:03,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:50:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:03,360 INFO L225 Difference]: With dead ends: 940 [2019-11-25 08:50:03,360 INFO L226 Difference]: Without dead ends: 532 [2019-11-25 08:50:03,361 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:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-25 08:50:03,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-11-25 08:50:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 629 transitions. [2019-11-25 08:50:03,376 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 629 transitions. Word has length 87 [2019-11-25 08:50:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:03,376 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 629 transitions. [2019-11-25 08:50:03,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 629 transitions. [2019-11-25 08:50:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:50:03,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:03,378 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:03,379 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:03,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:03,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1635005334, now seen corresponding path program 1 times [2019-11-25 08:50:03,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:03,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383689822] [2019-11-25 08:50:03,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:03,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383689822] [2019-11-25 08:50:03,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:03,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:03,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40201137] [2019-11-25 08:50:03,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:03,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:03,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:03,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:03,467 INFO L87 Difference]: Start difference. First operand 418 states and 629 transitions. Second operand 4 states. [2019-11-25 08:50:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:04,000 INFO L93 Difference]: Finished difference Result 791 states and 1178 transitions. [2019-11-25 08:50:04,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:04,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:50:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:04,005 INFO L225 Difference]: With dead ends: 791 [2019-11-25 08:50:04,005 INFO L226 Difference]: Without dead ends: 532 [2019-11-25 08:50:04,006 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:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-25 08:50:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-11-25 08:50:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:04,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 627 transitions. [2019-11-25 08:50:04,020 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 627 transitions. Word has length 87 [2019-11-25 08:50:04,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:04,021 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 627 transitions. [2019-11-25 08:50:04,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 627 transitions. [2019-11-25 08:50:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:50:04,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:04,023 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:04,023 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:04,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:04,023 INFO L82 PathProgramCache]: Analyzing trace with hash 513794263, now seen corresponding path program 2 times [2019-11-25 08:50:04,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:04,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258648090] [2019-11-25 08:50:04,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:04,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258648090] [2019-11-25 08:50:04,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:04,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:04,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995203257] [2019-11-25 08:50:04,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:04,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:04,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:04,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:04,097 INFO L87 Difference]: Start difference. First operand 418 states and 627 transitions. Second operand 4 states. [2019-11-25 08:50:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:04,427 INFO L93 Difference]: Finished difference Result 868 states and 1293 transitions. [2019-11-25 08:50:04,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:04,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:50:04,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:04,430 INFO L225 Difference]: With dead ends: 868 [2019-11-25 08:50:04,430 INFO L226 Difference]: Without dead ends: 460 [2019-11-25 08:50:04,431 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:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-25 08:50:04,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-11-25 08:50:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 625 transitions. [2019-11-25 08:50:04,444 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 625 transitions. Word has length 87 [2019-11-25 08:50:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:04,445 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 625 transitions. [2019-11-25 08:50:04,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 625 transitions. [2019-11-25 08:50:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:50:04,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:04,447 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:04,447 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:04,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:04,448 INFO L82 PathProgramCache]: Analyzing trace with hash 495138805, now seen corresponding path program 1 times [2019-11-25 08:50:04,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:04,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011168476] [2019-11-25 08:50:04,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:04,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011168476] [2019-11-25 08:50:04,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:04,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:04,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541957804] [2019-11-25 08:50:04,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:04,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:04,519 INFO L87 Difference]: Start difference. First operand 418 states and 625 transitions. Second operand 4 states. [2019-11-25 08:50:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:04,887 INFO L93 Difference]: Finished difference Result 868 states and 1289 transitions. [2019-11-25 08:50:04,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:04,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:50:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:04,890 INFO L225 Difference]: With dead ends: 868 [2019-11-25 08:50:04,890 INFO L226 Difference]: Without dead ends: 460 [2019-11-25 08:50:04,891 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:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-25 08:50:04,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-11-25 08:50:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 623 transitions. [2019-11-25 08:50:04,904 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 623 transitions. Word has length 87 [2019-11-25 08:50:04,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:04,904 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 623 transitions. [2019-11-25 08:50:04,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 623 transitions. [2019-11-25 08:50:04,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:50:04,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:04,906 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:04,906 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:04,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:04,907 INFO L82 PathProgramCache]: Analyzing trace with hash -210361832, now seen corresponding path program 1 times [2019-11-25 08:50:04,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:04,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129205722] [2019-11-25 08:50:04,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:04,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129205722] [2019-11-25 08:50:04,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:04,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:04,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064351469] [2019-11-25 08:50:04,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:04,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:04,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:04,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:04,986 INFO L87 Difference]: Start difference. First operand 418 states and 623 transitions. Second operand 4 states. [2019-11-25 08:50:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:05,377 INFO L93 Difference]: Finished difference Result 719 states and 1062 transitions. [2019-11-25 08:50:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:05,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:50:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:05,380 INFO L225 Difference]: With dead ends: 719 [2019-11-25 08:50:05,380 INFO L226 Difference]: Without dead ends: 460 [2019-11-25 08:50:05,381 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:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-25 08:50:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-11-25 08:50:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 621 transitions. [2019-11-25 08:50:05,398 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 621 transitions. Word has length 87 [2019-11-25 08:50:05,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:05,399 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 621 transitions. [2019-11-25 08:50:05,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 621 transitions. [2019-11-25 08:50:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:50:05,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:05,400 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-11-25 08:50:05,401 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:05,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:05,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1668397004, now seen corresponding path program 1 times [2019-11-25 08:50:05,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:05,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625670742] [2019-11-25 08:50:05,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:05,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625670742] [2019-11-25 08:50:05,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:05,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:05,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009852063] [2019-11-25 08:50:05,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:05,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:05,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:05,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:05,460 INFO L87 Difference]: Start difference. First operand 418 states and 621 transitions. Second operand 4 states. [2019-11-25 08:50:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:05,911 INFO L93 Difference]: Finished difference Result 940 states and 1388 transitions. [2019-11-25 08:50:05,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:05,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:50:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:05,915 INFO L225 Difference]: With dead ends: 940 [2019-11-25 08:50:05,915 INFO L226 Difference]: Without dead ends: 532 [2019-11-25 08:50:05,916 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:05,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-25 08:50:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-11-25 08:50:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 619 transitions. [2019-11-25 08:50:05,932 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 619 transitions. Word has length 88 [2019-11-25 08:50:05,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:05,932 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 619 transitions. [2019-11-25 08:50:05,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 619 transitions. [2019-11-25 08:50:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:50:05,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:05,934 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:05,934 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:05,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash -570561745, now seen corresponding path program 1 times [2019-11-25 08:50:05,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:05,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276233872] [2019-11-25 08:50:05,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:06,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276233872] [2019-11-25 08:50:06,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:06,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:06,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716090565] [2019-11-25 08:50:06,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:06,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:06,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:06,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:06,021 INFO L87 Difference]: Start difference. First operand 418 states and 619 transitions. Second operand 4 states. [2019-11-25 08:50:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:06,504 INFO L93 Difference]: Finished difference Result 785 states and 1156 transitions. [2019-11-25 08:50:06,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:06,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:50:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:06,507 INFO L225 Difference]: With dead ends: 785 [2019-11-25 08:50:06,507 INFO L226 Difference]: Without dead ends: 526 [2019-11-25 08:50:06,508 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:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-25 08:50:06,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2019-11-25 08:50:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 617 transitions. [2019-11-25 08:50:06,520 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 617 transitions. Word has length 88 [2019-11-25 08:50:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:06,520 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 617 transitions. [2019-11-25 08:50:06,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 617 transitions. [2019-11-25 08:50:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:50:06,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:06,522 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-11-25 08:50:06,523 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash 296589706, now seen corresponding path program 1 times [2019-11-25 08:50:06,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:06,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001211547] [2019-11-25 08:50:06,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:06,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001211547] [2019-11-25 08:50:06,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:06,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:06,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76740187] [2019-11-25 08:50:06,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:06,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:06,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:06,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:06,581 INFO L87 Difference]: Start difference. First operand 418 states and 617 transitions. Second operand 4 states. [2019-11-25 08:50:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:06,937 INFO L93 Difference]: Finished difference Result 868 states and 1273 transitions. [2019-11-25 08:50:06,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:06,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:50:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:06,941 INFO L225 Difference]: With dead ends: 868 [2019-11-25 08:50:06,941 INFO L226 Difference]: Without dead ends: 460 [2019-11-25 08:50:06,942 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:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-25 08:50:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-11-25 08:50:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 615 transitions. [2019-11-25 08:50:06,956 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 615 transitions. Word has length 88 [2019-11-25 08:50:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:06,956 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 615 transitions. [2019-11-25 08:50:06,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 615 transitions. [2019-11-25 08:50:06,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:50:06,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:06,958 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:06,959 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:06,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:06,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1942369043, now seen corresponding path program 1 times [2019-11-25 08:50:06,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:06,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379352598] [2019-11-25 08:50:06,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:07,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379352598] [2019-11-25 08:50:07,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:07,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:07,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099309224] [2019-11-25 08:50:07,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:07,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:07,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:07,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:07,034 INFO L87 Difference]: Start difference. First operand 418 states and 615 transitions. Second operand 4 states. [2019-11-25 08:50:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:07,422 INFO L93 Difference]: Finished difference Result 713 states and 1043 transitions. [2019-11-25 08:50:07,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:07,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:50:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:07,425 INFO L225 Difference]: With dead ends: 713 [2019-11-25 08:50:07,425 INFO L226 Difference]: Without dead ends: 454 [2019-11-25 08:50:07,426 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:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-25 08:50:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2019-11-25 08:50:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 613 transitions. [2019-11-25 08:50:07,440 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 613 transitions. Word has length 88 [2019-11-25 08:50:07,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:07,440 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 613 transitions. [2019-11-25 08:50:07,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 613 transitions. [2019-11-25 08:50:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:50:07,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:07,442 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:07,442 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:07,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:07,442 INFO L82 PathProgramCache]: Analyzing trace with hash -233112104, now seen corresponding path program 1 times [2019-11-25 08:50:07,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:07,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405903020] [2019-11-25 08:50:07,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:07,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405903020] [2019-11-25 08:50:07,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:07,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:07,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890151664] [2019-11-25 08:50:07,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:07,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:07,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:07,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:07,501 INFO L87 Difference]: Start difference. First operand 418 states and 613 transitions. Second operand 4 states. [2019-11-25 08:50:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:07,978 INFO L93 Difference]: Finished difference Result 934 states and 1365 transitions. [2019-11-25 08:50:07,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:07,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-25 08:50:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:07,981 INFO L225 Difference]: With dead ends: 934 [2019-11-25 08:50:07,981 INFO L226 Difference]: Without dead ends: 526 [2019-11-25 08:50:07,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-25 08:50:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2019-11-25 08:50:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 611 transitions. [2019-11-25 08:50:07,994 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 611 transitions. Word has length 89 [2019-11-25 08:50:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:07,995 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 611 transitions. [2019-11-25 08:50:07,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 611 transitions. [2019-11-25 08:50:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:50:07,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:07,996 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:07,997 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:07,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:07,997 INFO L82 PathProgramCache]: Analyzing trace with hash 190534618, now seen corresponding path program 1 times [2019-11-25 08:50:07,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:07,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073939032] [2019-11-25 08:50:07,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:08,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073939032] [2019-11-25 08:50:08,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:08,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:08,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579352376] [2019-11-25 08:50:08,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:08,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:08,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:08,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:08,068 INFO L87 Difference]: Start difference. First operand 418 states and 611 transitions. Second operand 4 states. [2019-11-25 08:50:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:08,402 INFO L93 Difference]: Finished difference Result 862 states and 1254 transitions. [2019-11-25 08:50:08,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:08,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-25 08:50:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:08,405 INFO L225 Difference]: With dead ends: 862 [2019-11-25 08:50:08,405 INFO L226 Difference]: Without dead ends: 454 [2019-11-25 08:50:08,406 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:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-25 08:50:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2019-11-25 08:50:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 609 transitions. [2019-11-25 08:50:08,418 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 609 transitions. Word has length 89 [2019-11-25 08:50:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:08,418 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 609 transitions. [2019-11-25 08:50:08,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 609 transitions. [2019-11-25 08:50:08,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-25 08:50:08,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:08,420 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-25 08:50:08,420 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:08,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:08,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1591319919, now seen corresponding path program 1 times [2019-11-25 08:50:08,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:08,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271947309] [2019-11-25 08:50:08,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:08,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271947309] [2019-11-25 08:50:08,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:08,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:08,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030362065] [2019-11-25 08:50:08,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:08,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:08,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:08,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:08,484 INFO L87 Difference]: Start difference. First operand 418 states and 609 transitions. Second operand 4 states. [2019-11-25 08:50:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:08,943 INFO L93 Difference]: Finished difference Result 916 states and 1335 transitions. [2019-11-25 08:50:08,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:08,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-25 08:50:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:08,946 INFO L225 Difference]: With dead ends: 916 [2019-11-25 08:50:08,947 INFO L226 Difference]: Without dead ends: 508 [2019-11-25 08:50:08,950 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:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-25 08:50:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2019-11-25 08:50:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 607 transitions. [2019-11-25 08:50:08,961 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 607 transitions. Word has length 90 [2019-11-25 08:50:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:08,962 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 607 transitions. [2019-11-25 08:50:08,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 607 transitions. [2019-11-25 08:50:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-25 08:50:08,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:08,964 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:08,964 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:08,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1012220386, now seen corresponding path program 1 times [2019-11-25 08:50:08,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:08,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467106299] [2019-11-25 08:50:08,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:09,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467106299] [2019-11-25 08:50:09,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:09,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:09,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987969538] [2019-11-25 08:50:09,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:09,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:09,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:09,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:09,040 INFO L87 Difference]: Start difference. First operand 418 states and 607 transitions. Second operand 4 states. [2019-11-25 08:50:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:09,512 INFO L93 Difference]: Finished difference Result 916 states and 1331 transitions. [2019-11-25 08:50:09,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:09,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-25 08:50:09,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:09,517 INFO L225 Difference]: With dead ends: 916 [2019-11-25 08:50:09,517 INFO L226 Difference]: Without dead ends: 508 [2019-11-25 08:50:09,518 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:09,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-25 08:50:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2019-11-25 08:50:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2019-11-25 08:50:09,529 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 90 [2019-11-25 08:50:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:09,529 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2019-11-25 08:50:09,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2019-11-25 08:50:09,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-25 08:50:09,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:09,531 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-25 08:50:09,531 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:09,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1343173425, now seen corresponding path program 1 times [2019-11-25 08:50:09,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:09,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741768299] [2019-11-25 08:50:09,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:50:09,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741768299] [2019-11-25 08:50:09,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:09,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:09,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121541929] [2019-11-25 08:50:09,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:09,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:09,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:09,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:09,596 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand 4 states. [2019-11-25 08:50:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:09,900 INFO L93 Difference]: Finished difference Result 844 states and 1220 transitions. [2019-11-25 08:50:09,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:09,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-25 08:50:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:09,903 INFO L225 Difference]: With dead ends: 844 [2019-11-25 08:50:09,903 INFO L226 Difference]: Without dead ends: 436 [2019-11-25 08:50:09,904 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:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-11-25 08:50:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 418. [2019-11-25 08:50:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-25 08:50:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 603 transitions. [2019-11-25 08:50:09,915 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 603 transitions. Word has length 90 [2019-11-25 08:50:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:09,916 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 603 transitions. [2019-11-25 08:50:09,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 603 transitions. [2019-11-25 08:50:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-25 08:50:09,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:09,918 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:09,918 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:09,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1260366880, now seen corresponding path program 1 times [2019-11-25 08:50:09,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:09,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438689139] [2019-11-25 08:50:09,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-25 08:50:09,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438689139] [2019-11-25 08:50:09,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:09,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:09,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918316614] [2019-11-25 08:50:09,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:09,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:09,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:09,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:09,981 INFO L87 Difference]: Start difference. First operand 418 states and 603 transitions. Second operand 3 states. [2019-11-25 08:50:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,016 INFO L93 Difference]: Finished difference Result 828 states and 1201 transitions. [2019-11-25 08:50:10,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:10,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-25 08:50:10,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,020 INFO L225 Difference]: With dead ends: 828 [2019-11-25 08:50:10,020 INFO L226 Difference]: Without dead ends: 571 [2019-11-25 08:50:10,022 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:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-25 08:50:10,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-11-25 08:50:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-25 08:50:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 824 transitions. [2019-11-25 08:50:10,036 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 824 transitions. Word has length 90 [2019-11-25 08:50:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:10,036 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 824 transitions. [2019-11-25 08:50:10,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 824 transitions. [2019-11-25 08:50:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-25 08:50:10,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:10,039 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:10,039 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:10,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:10,039 INFO L82 PathProgramCache]: Analyzing trace with hash -584407498, now seen corresponding path program 1 times [2019-11-25 08:50:10,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:10,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345413998] [2019-11-25 08:50:10,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-25 08:50:10,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345413998] [2019-11-25 08:50:10,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:10,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:10,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531643948] [2019-11-25 08:50:10,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:10,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:10,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:10,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:10,095 INFO L87 Difference]: Start difference. First operand 571 states and 824 transitions. Second operand 3 states. [2019-11-25 08:50:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,132 INFO L93 Difference]: Finished difference Result 726 states and 1049 transitions. [2019-11-25 08:50:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:10,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-25 08:50:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,137 INFO L225 Difference]: With dead ends: 726 [2019-11-25 08:50:10,137 INFO L226 Difference]: Without dead ends: 724 [2019-11-25 08:50:10,137 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:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-25 08:50:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2019-11-25 08:50:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-11-25 08:50:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1046 transitions. [2019-11-25 08:50:10,156 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1046 transitions. Word has length 92 [2019-11-25 08:50:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:10,156 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1046 transitions. [2019-11-25 08:50:10,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1046 transitions. [2019-11-25 08:50:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-25 08:50:10,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:10,158 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:10,159 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:10,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:10,159 INFO L82 PathProgramCache]: Analyzing trace with hash -782701753, now seen corresponding path program 1 times [2019-11-25 08:50:10,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:10,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257842417] [2019-11-25 08:50:10,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-25 08:50:10,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257842417] [2019-11-25 08:50:10,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:10,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:10,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951265686] [2019-11-25 08:50:10,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:10,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:10,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:10,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:10,225 INFO L87 Difference]: Start difference. First operand 724 states and 1046 transitions. Second operand 3 states. [2019-11-25 08:50:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,250 INFO L93 Difference]: Finished difference Result 726 states and 1047 transitions. [2019-11-25 08:50:10,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:10,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-25 08:50:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,254 INFO L225 Difference]: With dead ends: 726 [2019-11-25 08:50:10,254 INFO L226 Difference]: Without dead ends: 724 [2019-11-25 08:50:10,255 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:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-25 08:50:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2019-11-25 08:50:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-11-25 08:50:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1045 transitions. [2019-11-25 08:50:10,322 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1045 transitions. Word has length 113 [2019-11-25 08:50:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:10,322 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1045 transitions. [2019-11-25 08:50:10,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1045 transitions. [2019-11-25 08:50:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-25 08:50:10,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:10,324 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:10,325 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:10,326 INFO L82 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2019-11-25 08:50:10,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:10,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533178716] [2019-11-25 08:50:10,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-25 08:50:10,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533178716] [2019-11-25 08:50:10,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:10,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:10,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436182972] [2019-11-25 08:50:10,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:10,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:10,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:10,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:10,411 INFO L87 Difference]: Start difference. First operand 724 states and 1045 transitions. Second operand 4 states. [2019-11-25 08:50:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,778 INFO L93 Difference]: Finished difference Result 1695 states and 2458 transitions. [2019-11-25 08:50:10,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:10,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-25 08:50:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,785 INFO L225 Difference]: With dead ends: 1695 [2019-11-25 08:50:10,785 INFO L226 Difference]: Without dead ends: 981 [2019-11-25 08:50:10,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-11-25 08:50:10,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 844. [2019-11-25 08:50:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-11-25 08:50:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1255 transitions. [2019-11-25 08:50:10,810 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1255 transitions. Word has length 115 [2019-11-25 08:50:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:10,810 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1255 transitions. [2019-11-25 08:50:10,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1255 transitions. [2019-11-25 08:50:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-25 08:50:10,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:10,813 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:10,813 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:10,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:10,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1667253281, now seen corresponding path program 2 times [2019-11-25 08:50:10,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:10,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276564449] [2019-11-25 08:50:10,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-25 08:50:10,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276564449] [2019-11-25 08:50:10,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:10,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:10,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350100796] [2019-11-25 08:50:10,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:10,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:10,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:10,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:10,889 INFO L87 Difference]: Start difference. First operand 844 states and 1255 transitions. Second operand 4 states. [2019-11-25 08:50:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:11,231 INFO L93 Difference]: Finished difference Result 1810 states and 2658 transitions. [2019-11-25 08:50:11,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:11,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-25 08:50:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:11,237 INFO L225 Difference]: With dead ends: 1810 [2019-11-25 08:50:11,237 INFO L226 Difference]: Without dead ends: 976 [2019-11-25 08:50:11,239 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:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-11-25 08:50:11,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-11-25 08:50:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-11-25 08:50:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1250 transitions. [2019-11-25 08:50:11,262 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1250 transitions. Word has length 130 [2019-11-25 08:50:11,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,262 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1250 transitions. [2019-11-25 08:50:11,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1250 transitions. [2019-11-25 08:50:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-25 08:50:11,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,265 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:11,265 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,266 INFO L82 PathProgramCache]: Analyzing trace with hash 919227327, now seen corresponding path program 1 times [2019-11-25 08:50:11,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149645443] [2019-11-25 08:50:11,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-25 08:50:11,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149645443] [2019-11-25 08:50:11,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:11,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:11,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7432003] [2019-11-25 08:50:11,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:11,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:11,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:11,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:11,351 INFO L87 Difference]: Start difference. First operand 844 states and 1250 transitions. Second operand 4 states. [2019-11-25 08:50:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:11,732 INFO L93 Difference]: Finished difference Result 1810 states and 2648 transitions. [2019-11-25 08:50:11,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:11,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-25 08:50:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:11,738 INFO L225 Difference]: With dead ends: 1810 [2019-11-25 08:50:11,738 INFO L226 Difference]: Without dead ends: 976 [2019-11-25 08:50:11,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-11-25 08:50:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-11-25 08:50:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-11-25 08:50:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1245 transitions. [2019-11-25 08:50:11,764 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1245 transitions. Word has length 130 [2019-11-25 08:50:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,765 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1245 transitions. [2019-11-25 08:50:11,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1245 transitions. [2019-11-25 08:50:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-25 08:50:11,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,768 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:11,768 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1537947938, now seen corresponding path program 1 times [2019-11-25 08:50:11,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463304091] [2019-11-25 08:50:11,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 08:50:11,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463304091] [2019-11-25 08:50:11,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:11,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:11,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580845974] [2019-11-25 08:50:11,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:11,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:11,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:11,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:11,842 INFO L87 Difference]: Start difference. First operand 844 states and 1245 transitions. Second operand 4 states. [2019-11-25 08:50:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:12,191 INFO L93 Difference]: Finished difference Result 1641 states and 2428 transitions. [2019-11-25 08:50:12,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:12,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-25 08:50:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:12,197 INFO L225 Difference]: With dead ends: 1641 [2019-11-25 08:50:12,197 INFO L226 Difference]: Without dead ends: 982 [2019-11-25 08:50:12,199 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:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-11-25 08:50:12,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 916. [2019-11-25 08:50:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-25 08:50:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1365 transitions. [2019-11-25 08:50:12,225 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1365 transitions. Word has length 130 [2019-11-25 08:50:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:12,225 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1365 transitions. [2019-11-25 08:50:12,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1365 transitions. [2019-11-25 08:50:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-25 08:50:12,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:12,228 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:12,228 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:12,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:12,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1834884522, now seen corresponding path program 1 times [2019-11-25 08:50:12,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:12,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263020473] [2019-11-25 08:50:12,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-25 08:50:12,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263020473] [2019-11-25 08:50:12,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:12,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:12,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158022002] [2019-11-25 08:50:12,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:12,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:12,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:12,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:12,307 INFO L87 Difference]: Start difference. First operand 916 states and 1365 transitions. Second operand 4 states. [2019-11-25 08:50:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:12,632 INFO L93 Difference]: Finished difference Result 1954 states and 2878 transitions. [2019-11-25 08:50:12,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:12,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-11-25 08:50:12,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:12,638 INFO L225 Difference]: With dead ends: 1954 [2019-11-25 08:50:12,638 INFO L226 Difference]: Without dead ends: 1048 [2019-11-25 08:50:12,639 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:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-11-25 08:50:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-11-25 08:50:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-25 08:50:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1360 transitions. [2019-11-25 08:50:12,664 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1360 transitions. Word has length 131 [2019-11-25 08:50:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:12,664 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1360 transitions. [2019-11-25 08:50:12,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:12,665 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1360 transitions. [2019-11-25 08:50:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-25 08:50:12,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:12,667 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:12,668 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:12,668 INFO L82 PathProgramCache]: Analyzing trace with hash 653511332, now seen corresponding path program 1 times [2019-11-25 08:50:12,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:12,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508572938] [2019-11-25 08:50:12,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-25 08:50:12,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508572938] [2019-11-25 08:50:12,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:12,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:12,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626049456] [2019-11-25 08:50:12,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:12,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:12,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:12,748 INFO L87 Difference]: Start difference. First operand 916 states and 1360 transitions. Second operand 4 states. [2019-11-25 08:50:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:13,108 INFO L93 Difference]: Finished difference Result 1954 states and 2868 transitions. [2019-11-25 08:50:13,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:13,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-25 08:50:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:13,114 INFO L225 Difference]: With dead ends: 1954 [2019-11-25 08:50:13,115 INFO L226 Difference]: Without dead ends: 1048 [2019-11-25 08:50:13,117 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:13,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-11-25 08:50:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-11-25 08:50:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-25 08:50:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1355 transitions. [2019-11-25 08:50:13,143 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1355 transitions. Word has length 132 [2019-11-25 08:50:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,144 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1355 transitions. [2019-11-25 08:50:13,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1355 transitions. [2019-11-25 08:50:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-25 08:50:13,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,147 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,147 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1844078565, now seen corresponding path program 1 times [2019-11-25 08:50:13,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966069236] [2019-11-25 08:50:13,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-25 08:50:13,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966069236] [2019-11-25 08:50:13,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:13,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:13,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278928006] [2019-11-25 08:50:13,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:13,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:13,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:13,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:13,256 INFO L87 Difference]: Start difference. First operand 916 states and 1355 transitions. Second operand 4 states. [2019-11-25 08:50:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:13,653 INFO L93 Difference]: Finished difference Result 1909 states and 2803 transitions. [2019-11-25 08:50:13,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:13,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-25 08:50:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:13,659 INFO L225 Difference]: With dead ends: 1909 [2019-11-25 08:50:13,659 INFO L226 Difference]: Without dead ends: 1003 [2019-11-25 08:50:13,661 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:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-11-25 08:50:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 916. [2019-11-25 08:50:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-25 08:50:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1350 transitions. [2019-11-25 08:50:13,686 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1350 transitions. Word has length 133 [2019-11-25 08:50:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,686 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1350 transitions. [2019-11-25 08:50:13,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1350 transitions. [2019-11-25 08:50:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-25 08:50:13,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,689 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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:13,689 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,690 INFO L82 PathProgramCache]: Analyzing trace with hash 487188268, now seen corresponding path program 1 times [2019-11-25 08:50:13,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776112316] [2019-11-25 08:50:13,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-25 08:50:13,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776112316] [2019-11-25 08:50:13,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:13,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:13,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373469818] [2019-11-25 08:50:13,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:13,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:13,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:13,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:13,774 INFO L87 Difference]: Start difference. First operand 916 states and 1350 transitions. Second operand 4 states. [2019-11-25 08:50:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,191 INFO L93 Difference]: Finished difference Result 2054 states and 3033 transitions. [2019-11-25 08:50:14,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:14,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-25 08:50:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,198 INFO L225 Difference]: With dead ends: 2054 [2019-11-25 08:50:14,199 INFO L226 Difference]: Without dead ends: 1148 [2019-11-25 08:50:14,200 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:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-25 08:50:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1026. [2019-11-25 08:50:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-11-25 08:50:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1540 transitions. [2019-11-25 08:50:14,229 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1540 transitions. Word has length 133 [2019-11-25 08:50:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,230 INFO L462 AbstractCegarLoop]: Abstraction has 1026 states and 1540 transitions. [2019-11-25 08:50:14,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1540 transitions. [2019-11-25 08:50:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-25 08:50:14,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,233 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:14,233 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2019-11-25 08:50:14,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531529196] [2019-11-25 08:50:14,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:14,756 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:14,756 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:50:14,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:50:14 BoogieIcfgContainer [2019-11-25 08:50:14,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:50:14,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:50:14,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:50:14,914 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:50:14,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:57" (3/4) ... [2019-11-25 08:50:14,927 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:50:14,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:50:14,930 INFO L168 Benchmark]: Toolchain (without parser) took 19546.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 388.0 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -207.2 MB). Peak memory consumption was 180.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:14,930 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:14,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -136.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:14,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:14,931 INFO L168 Benchmark]: Boogie Preprocessor took 125.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:14,932 INFO L168 Benchmark]: RCFGBuilder took 1098.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 982.5 MB in the end (delta: 92.3 MB). Peak memory consumption was 92.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:14,933 INFO L168 Benchmark]: TraceAbstraction took 17452.19 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 982.5 MB in the beginning and 1.2 GB in the end (delta: -169.5 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:14,933 INFO L168 Benchmark]: Witness Printer took 14.40 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-25 08:50:14,935 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 755.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -136.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 125.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1098.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 982.5 MB in the end (delta: 92.3 MB). Peak memory consumption was 92.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17452.19 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 982.5 MB in the beginning and 1.2 GB in the end (delta: -169.5 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. * Witness Printer took 14.40 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1644]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1329. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={9:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] EXPR s->info_callback VAL [init=1, SSLv3_client_data={9:0}] [L1109] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1110] EXPR s->info_callback [L1110] cb = s->info_callback [L1118] EXPR s->in_handshake [L1118] s->in_handshake += 1 [L1119] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND TRUE s->state == 12292 [L1235] s->new_session = 1 [L1236] s->state = 4096 [L1237] EXPR s->ctx [L1237] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1237] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1242] s->server = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1243] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={9:0}] [L1248] EXPR s->version VAL [init=1, SSLv3_client_data={9:0}] [L1248] COND FALSE !((s->version & 65280) != 768) [L1254] s->type = 4096 [L1255] EXPR s->init_buf VAL [init=1, SSLv3_client_data={9:0}] [L1255] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1267] tmp___4 = __VERIFIER_nondet_int() [L1268] COND FALSE !(! tmp___4) [L1274] tmp___5 = __VERIFIER_nondet_int() [L1275] COND FALSE !(! tmp___5) [L1281] s->state = 4368 [L1282] EXPR s->ctx [L1282] EXPR (s->ctx)->stats.sess_connect [L1282] (s->ctx)->stats.sess_connect += 1 [L1283] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND TRUE s->state == 4368 [L1287] s->shutdown = 0 [L1288] ret = __VERIFIER_nondet_int() [L1289] COND TRUE blastFlag == 0 [L1290] blastFlag = 1 VAL [init=1, SSLv3_client_data={9:0}] [L1294] COND FALSE !(ret <= 0) [L1299] s->state = 4384 [L1300] s->init_num = 0 [L1301] EXPR s->bbio [L1301] EXPR s->wbio VAL [init=1, SSLv3_client_data={9:0}] [L1301] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND TRUE s->state == 4384 [L1309] ret = __VERIFIER_nondet_int() [L1310] COND TRUE blastFlag == 1 [L1311] blastFlag = 2 VAL [init=1, SSLv3_client_data={9:0}] [L1315] COND FALSE !(ret <= 0) [L1320] s->hit VAL [init=1, SSLv3_client_data={9:0}] [L1320] COND FALSE !(s->hit) [L1323] s->state = 4400 VAL [init=1, SSLv3_client_data={9:0}] [L1325] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1159] COND TRUE s->state == 4400 [L1329] EXPR s->s3 [L1329] EXPR (s->s3)->tmp.new_cipher [L1329] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={9:0}] [L1329] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1332] ret = __VERIFIER_nondet_int() [L1333] COND TRUE blastFlag == 2 [L1334] blastFlag = 3 VAL [init=1, SSLv3_client_data={9:0}] [L1338] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={9:0}] [L1344] s->state = 4416 [L1345] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1165] COND TRUE s->state == 4416 [L1349] ret = __VERIFIER_nondet_int() [L1350] COND TRUE blastFlag == 3 [L1351] blastFlag = 4 VAL [init=1, SSLv3_client_data={9:0}] [L1355] COND FALSE !(ret <= 0) [L1360] s->state = 4432 [L1361] s->init_num = 0 [L1362] tmp___6 = __VERIFIER_nondet_int() [L1363] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1171] COND TRUE s->state == 4432 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={9:0}] [L1378] COND FALSE !(ret <= 0) [L1383] s->state = 4448 [L1384] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1171] COND FALSE !(s->state == 4432) [L1174] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1174] COND FALSE !(s->state == 4433) [L1177] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1177] COND TRUE s->state == 4448 [L1388] ret = __VERIFIER_nondet_int() [L1389] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={9:0}] [L1644] __VERIFIER_error() VAL [init=1, SSLv3_client_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Result: UNSAFE, OverallTime: 17.3s, OverallIterations: 35, TraceHistogramMax: 7, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7208 SDtfs, 2447 SDslu, 9311 SDs, 0 SdLazy, 5221 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 68 SyntacticMatches, 21 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1026occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 2607 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3271 NumberOfCodeBlocks, 3271 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3100 ConstructedInterpolants, 0 QuantifiedInterpolants, 675721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 3328/3328 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:50:16,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:50:16,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:50:16,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:50:16,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:50:16,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:50:16,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:50:16,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:50:16,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:50:16,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:50:16,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:50:16,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:50:16,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:50:16,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:50:16,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:50:16,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:50:16,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:50:16,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:50:16,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:50:16,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:50:16,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:50:16,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:50:16,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:50:16,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:50:16,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:50:16,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:50:16,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:50:16,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:50:16,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:50:16,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:50:16,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:50:16,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:50:16,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:50:16,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:50:16,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:50:16,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:50:16,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:50:16,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:50:16,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:50:16,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:50:16,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:50:16,938 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:50:16,952 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:50:16,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:50:16,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:50:16,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:50:16,954 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:50:16,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:50:16,955 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:50:16,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:50:16,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:50:16,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:50:16,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:50:16,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:50:16,956 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:50:16,956 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:50:16,957 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:50:16,957 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:50:16,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:50:16,957 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:50:16,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:50:16,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:50:16,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:50:16,958 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:50:16,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:50:16,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:50:16,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:50:16,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:50:16,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:50:16,960 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:50:16,960 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:50:16,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:50:16,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:50:16,961 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_9f5acf52-db58-4162-b5c7-9f805c746aba/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 -> 6b059dfef9f85366fcaeddec812cf96c32b1df0d [2019-11-25 08:50:17,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:50:17,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:50:17,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:50:17,247 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:50:17,248 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:50:17,248 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-11-25 08:50:17,303 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/data/16cce6730/8216e597313844148af64c1e395e0944/FLAGff70533d9 [2019-11-25 08:50:17,800 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:50:17,801 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-11-25 08:50:17,817 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/data/16cce6730/8216e597313844148af64c1e395e0944/FLAGff70533d9 [2019-11-25 08:50:18,061 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9f5acf52-db58-4162-b5c7-9f805c746aba/bin/uautomizer/data/16cce6730/8216e597313844148af64c1e395e0944 [2019-11-25 08:50:18,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:50:18,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:50:18,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:18,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:50:18,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:50:18,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:18" (1/1) ... [2019-11-25 08:50:18,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f54ae8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:18, skipping insertion in model container [2019-11-25 08:50:18,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:18" (1/1) ... [2019-11-25 08:50:18,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:50:18,155 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:50:18,558 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:50:18,558 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-25 08:50:18,558 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:50:18,574 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:50:18,574 INFO L968 CHandler]: at location: C: (SSL*)malloc(sizeof(SSL)) [1065] [2019-11-25 08:50:18,575 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:50:18,600 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:50:18,607 INFO L168 Benchmark]: Toolchain (without parser) took 540.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -204.8 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:18,608 INFO L168 Benchmark]: CDTParser took 0.25 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:50:18,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -204.8 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:18,611 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.25 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 538.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -204.8 MB). Peak memory consumption was 28.3 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...