./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/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 1952eae46575e60399f761afaedbe356b8f81a96 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/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 1952eae46575e60399f761afaedbe356b8f81a96 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:26:14,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:26:14,085 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:26:14,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:26:14,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:26:14,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:26:14,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:26:14,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:26:14,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:26:14,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:26:14,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:26:14,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:26:14,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:26:14,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:26:14,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:26:14,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:26:14,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:26:14,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:26:14,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:26:14,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:26:14,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:26:14,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:26:14,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:26:14,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:26:14,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:26:14,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:26:14,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:26:14,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:26:14,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:26:14,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:26:14,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:26:14,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:26:14,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:26:14,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:26:14,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:26:14,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:26:14,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:26:14,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:26:14,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:26:14,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:26:14,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:26:14,115 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:26:14,124 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:26:14,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:26:14,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:26:14,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:26:14,125 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:26:14,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:26:14,125 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:26:14,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:26:14,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:26:14,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:26:14,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:26:14,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:26:14,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:26:14,126 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:26:14,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:26:14,126 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:26:14,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:26:14,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:26:14,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:26:14,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:26:14,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:26:14,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:26:14,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:26:14,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:26:14,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:26:14,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:26:14,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:26:14,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:26:14,127 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:26:14,128 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_2fe9ad6e-a730-4f55-85cf-5dc157286d78/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 -> 1952eae46575e60399f761afaedbe356b8f81a96 [2019-12-07 11:26:14,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:26:14,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:26:14,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:26:14,237 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:26:14,237 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:26:14,238 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-12-07 11:26:14,275 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/data/0e4ec155a/b60f8934bce24cf5bc731c298d715ff7/FLAG09823ccea [2019-12-07 11:26:14,769 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:26:14,770 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-12-07 11:26:14,782 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/data/0e4ec155a/b60f8934bce24cf5bc731c298d715ff7/FLAG09823ccea [2019-12-07 11:26:14,792 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/data/0e4ec155a/b60f8934bce24cf5bc731c298d715ff7 [2019-12-07 11:26:14,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:26:14,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:26:14,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:26:14,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:26:14,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:26:14,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:26:14" (1/1) ... [2019-12-07 11:26:14,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8207e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:14, skipping insertion in model container [2019-12-07 11:26:14,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:26:14" (1/1) ... [2019-12-07 11:26:14,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:26:14,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:26:15,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:26:15,113 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:26:15,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:26:15,190 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:26:15,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:15 WrapperNode [2019-12-07 11:26:15,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:26:15,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:26:15,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:26:15,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:26:15,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:15" (1/1) ... [2019-12-07 11:26:15,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:15" (1/1) ... [2019-12-07 11:26:15,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:26:15,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:26:15,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:26:15,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:26:15,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:15" (1/1) ... [2019-12-07 11:26:15,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:15" (1/1) ... [2019-12-07 11:26:15,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:15" (1/1) ... [2019-12-07 11:26:15,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:15" (1/1) ... [2019-12-07 11:26:15,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:15" (1/1) ... [2019-12-07 11:26:15,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:15" (1/1) ... [2019-12-07 11:26:15,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:15" (1/1) ... [2019-12-07 11:26:15,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:26:15,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:26:15,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:26:15,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:26:15,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:26:15,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:26:15,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:26:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:26:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:26:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:26:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:26:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:26:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:26:15,508 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:26:15,994 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 11:26:15,994 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 11:26:15,995 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:26:15,995 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:26:15,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:26:15 BoogieIcfgContainer [2019-12-07 11:26:15,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:26:15,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:26:15,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:26:15,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:26:15,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:26:14" (1/3) ... [2019-12-07 11:26:16,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44acf2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:26:15, skipping insertion in model container [2019-12-07 11:26:16,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:15" (2/3) ... [2019-12-07 11:26:16,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44acf2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:26:16, skipping insertion in model container [2019-12-07 11:26:16,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:26:15" (3/3) ... [2019-12-07 11:26:16,001 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2019-12-07 11:26:16,008 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:26:16,012 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:26:16,020 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:26:16,036 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:26:16,036 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:26:16,036 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:26:16,036 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:26:16,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:26:16,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:26:16,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:26:16,037 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:26:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-12-07 11:26:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:26:16,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:16,056 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:16,056 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:16,060 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-12-07 11:26:16,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:16,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281604955] [2019-12-07 11:26:16,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:16,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:16,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281604955] [2019-12-07 11:26:16,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:16,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:16,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035997566] [2019-12-07 11:26:16,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:16,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:16,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:16,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:16,276 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-12-07 11:26:16,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:16,588 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-12-07 11:26:16,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:16,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 11:26:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:16,598 INFO L225 Difference]: With dead ends: 313 [2019-12-07 11:26:16,598 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 11:26:16,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 11:26:16,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-12-07 11:26:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 11:26:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-12-07 11:26:16,634 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-12-07 11:26:16,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:16,635 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-12-07 11:26:16,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-12-07 11:26:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:26:16,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:16,637 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:16,638 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-12-07 11:26:16,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:16,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249633968] [2019-12-07 11:26:16,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:16,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249633968] [2019-12-07 11:26:16,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:16,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:16,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667561126] [2019-12-07 11:26:16,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:16,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:16,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:16,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:16,718 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-12-07 11:26:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:16,947 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-12-07 11:26:16,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:16,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 11:26:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:16,949 INFO L225 Difference]: With dead ends: 280 [2019-12-07 11:26:16,950 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 11:26:16,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 11:26:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-12-07 11:26:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 11:26:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-12-07 11:26:16,959 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-12-07 11:26:16,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:16,959 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-12-07 11:26:16,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-12-07 11:26:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:26:16,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:16,961 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:16,961 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:16,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:16,961 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-12-07 11:26:16,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:16,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380388694] [2019-12-07 11:26:16,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:17,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380388694] [2019-12-07 11:26:17,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:17,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:17,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776976266] [2019-12-07 11:26:17,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:17,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:17,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:17,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:17,032 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-12-07 11:26:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:17,253 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-12-07 11:26:17,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:17,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 11:26:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:17,255 INFO L225 Difference]: With dead ends: 279 [2019-12-07 11:26:17,255 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 11:26:17,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 11:26:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-12-07 11:26:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 11:26:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-12-07 11:26:17,262 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-12-07 11:26:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:17,262 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-12-07 11:26:17,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-12-07 11:26:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:26:17,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:17,264 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:17,264 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:17,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:17,264 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-12-07 11:26:17,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:17,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788291387] [2019-12-07 11:26:17,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:17,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788291387] [2019-12-07 11:26:17,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:17,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:17,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313189088] [2019-12-07 11:26:17,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:17,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:17,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:17,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:17,314 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-12-07 11:26:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:17,513 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-12-07 11:26:17,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:17,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 11:26:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:17,514 INFO L225 Difference]: With dead ends: 277 [2019-12-07 11:26:17,514 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 11:26:17,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 11:26:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-12-07 11:26:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 11:26:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-12-07 11:26:17,521 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-12-07 11:26:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:17,521 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-12-07 11:26:17,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-12-07 11:26:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:26:17,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:17,522 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:17,522 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:17,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-12-07 11:26:17,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:17,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113668821] [2019-12-07 11:26:17,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:17,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113668821] [2019-12-07 11:26:17,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:17,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:17,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746968471] [2019-12-07 11:26:17,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:17,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:17,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:17,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:17,570 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-12-07 11:26:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:17,756 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-12-07 11:26:17,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:17,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 11:26:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:17,758 INFO L225 Difference]: With dead ends: 276 [2019-12-07 11:26:17,758 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 11:26:17,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 11:26:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-12-07 11:26:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 11:26:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-12-07 11:26:17,763 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-12-07 11:26:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:17,763 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-12-07 11:26:17,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-12-07 11:26:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:26:17,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:17,764 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:17,764 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:17,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:17,765 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-12-07 11:26:17,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:17,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385290465] [2019-12-07 11:26:17,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:17,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385290465] [2019-12-07 11:26:17,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:17,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:17,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614548034] [2019-12-07 11:26:17,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:17,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:17,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:17,805 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-12-07 11:26:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:17,981 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-12-07 11:26:17,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:17,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 11:26:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:17,983 INFO L225 Difference]: With dead ends: 276 [2019-12-07 11:26:17,983 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 11:26:17,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 11:26:17,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-12-07 11:26:17,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 11:26:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-12-07 11:26:17,987 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-12-07 11:26:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:17,988 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-12-07 11:26:17,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-12-07 11:26:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 11:26:17,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:17,988 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:17,988 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:17,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:17,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-12-07 11:26:17,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:17,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237160101] [2019-12-07 11:26:17,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:18,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237160101] [2019-12-07 11:26:18,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:18,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:18,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638276287] [2019-12-07 11:26:18,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:18,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:18,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:18,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:18,027 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-12-07 11:26:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:18,212 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-12-07 11:26:18,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:18,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 11:26:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:18,214 INFO L225 Difference]: With dead ends: 276 [2019-12-07 11:26:18,214 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 11:26:18,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 11:26:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-12-07 11:26:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 11:26:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-12-07 11:26:18,219 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-12-07 11:26:18,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:18,219 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-12-07 11:26:18,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-12-07 11:26:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 11:26:18,220 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:18,220 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:18,220 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:18,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:18,220 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-12-07 11:26:18,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:18,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001883765] [2019-12-07 11:26:18,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:18,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001883765] [2019-12-07 11:26:18,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:18,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:18,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7412910] [2019-12-07 11:26:18,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:18,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:18,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:18,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:18,265 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-12-07 11:26:18,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:18,478 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-12-07 11:26:18,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:18,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 11:26:18,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:18,480 INFO L225 Difference]: With dead ends: 276 [2019-12-07 11:26:18,480 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 11:26:18,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:18,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 11:26:18,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-12-07 11:26:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 11:26:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-12-07 11:26:18,483 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-12-07 11:26:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:18,484 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-12-07 11:26:18,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:18,484 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-12-07 11:26:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:26:18,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:18,484 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:18,484 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-12-07 11:26:18,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:18,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354947869] [2019-12-07 11:26:18,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:18,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354947869] [2019-12-07 11:26:18,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:18,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:18,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833424764] [2019-12-07 11:26:18,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:18,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:18,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:18,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:18,518 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-12-07 11:26:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:18,698 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-12-07 11:26:18,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:18,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 11:26:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:18,700 INFO L225 Difference]: With dead ends: 266 [2019-12-07 11:26:18,700 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 11:26:18,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 11:26:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-12-07 11:26:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 11:26:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-12-07 11:26:18,703 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-12-07 11:26:18,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:18,703 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-12-07 11:26:18,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-12-07 11:26:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:26:18,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:18,704 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:18,704 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:18,704 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-12-07 11:26:18,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:18,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613631154] [2019-12-07 11:26:18,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:18,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613631154] [2019-12-07 11:26:18,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:18,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:18,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251174213] [2019-12-07 11:26:18,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:18,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:18,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:18,738 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-12-07 11:26:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:18,941 INFO L93 Difference]: Finished difference Result 307 states and 462 transitions. [2019-12-07 11:26:18,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:18,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 11:26:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:18,943 INFO L225 Difference]: With dead ends: 307 [2019-12-07 11:26:18,943 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 11:26:18,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:18,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 11:26:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-12-07 11:26:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 11:26:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-12-07 11:26:18,948 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-12-07 11:26:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:18,949 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-12-07 11:26:18,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-12-07 11:26:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 11:26:18,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:18,950 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:18,950 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:18,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:18,950 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-12-07 11:26:18,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:18,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542515186] [2019-12-07 11:26:18,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:18,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542515186] [2019-12-07 11:26:18,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:18,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:18,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922310412] [2019-12-07 11:26:18,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:18,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:18,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:18,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:18,995 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-12-07 11:26:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:19,225 INFO L93 Difference]: Finished difference Result 329 states and 499 transitions. [2019-12-07 11:26:19,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:19,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 11:26:19,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:19,226 INFO L225 Difference]: With dead ends: 329 [2019-12-07 11:26:19,226 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 11:26:19,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 11:26:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-12-07 11:26:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 11:26:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-12-07 11:26:19,230 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-12-07 11:26:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:19,230 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-12-07 11:26:19,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-12-07 11:26:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 11:26:19,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:19,231 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:19,231 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:19,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:19,231 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-12-07 11:26:19,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:19,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283336078] [2019-12-07 11:26:19,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:19,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283336078] [2019-12-07 11:26:19,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:19,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:19,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551307618] [2019-12-07 11:26:19,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:19,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:19,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:19,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:19,267 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-12-07 11:26:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:19,477 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2019-12-07 11:26:19,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:19,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 11:26:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:19,479 INFO L225 Difference]: With dead ends: 328 [2019-12-07 11:26:19,479 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 11:26:19,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 11:26:19,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-12-07 11:26:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 11:26:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-12-07 11:26:19,484 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-12-07 11:26:19,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:19,485 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-12-07 11:26:19,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-12-07 11:26:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 11:26:19,486 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:19,486 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:19,486 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:19,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:19,486 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-12-07 11:26:19,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:19,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121322045] [2019-12-07 11:26:19,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:19,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121322045] [2019-12-07 11:26:19,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:19,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:19,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303917745] [2019-12-07 11:26:19,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:19,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:19,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:19,525 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-12-07 11:26:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:19,746 INFO L93 Difference]: Finished difference Result 326 states and 492 transitions. [2019-12-07 11:26:19,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:19,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 11:26:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:19,747 INFO L225 Difference]: With dead ends: 326 [2019-12-07 11:26:19,747 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 11:26:19,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:19,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 11:26:19,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2019-12-07 11:26:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 11:26:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-12-07 11:26:19,753 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-12-07 11:26:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:19,753 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-12-07 11:26:19,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-12-07 11:26:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 11:26:19,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:19,754 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:19,754 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:19,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-12-07 11:26:19,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:19,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714683036] [2019-12-07 11:26:19,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:19,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714683036] [2019-12-07 11:26:19,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:19,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:19,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744538701] [2019-12-07 11:26:19,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:19,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:19,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:19,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:19,798 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-12-07 11:26:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:20,058 INFO L93 Difference]: Finished difference Result 325 states and 489 transitions. [2019-12-07 11:26:20,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:20,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 11:26:20,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:20,060 INFO L225 Difference]: With dead ends: 325 [2019-12-07 11:26:20,060 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 11:26:20,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 11:26:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-12-07 11:26:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 11:26:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-12-07 11:26:20,065 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-12-07 11:26:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:20,065 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-12-07 11:26:20,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-12-07 11:26:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 11:26:20,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:20,066 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:20,066 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:20,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:20,067 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-12-07 11:26:20,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:20,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544454789] [2019-12-07 11:26:20,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:20,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544454789] [2019-12-07 11:26:20,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:20,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:20,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226624969] [2019-12-07 11:26:20,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:20,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:20,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:20,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:20,102 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-12-07 11:26:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:20,320 INFO L93 Difference]: Finished difference Result 325 states and 487 transitions. [2019-12-07 11:26:20,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:20,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 11:26:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:20,321 INFO L225 Difference]: With dead ends: 325 [2019-12-07 11:26:20,322 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 11:26:20,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 11:26:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-12-07 11:26:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 11:26:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-12-07 11:26:20,325 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-12-07 11:26:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:20,325 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-12-07 11:26:20,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-12-07 11:26:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 11:26:20,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:20,326 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:20,326 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:20,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:20,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-12-07 11:26:20,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:20,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020780475] [2019-12-07 11:26:20,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:20,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020780475] [2019-12-07 11:26:20,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:20,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:20,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586762835] [2019-12-07 11:26:20,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:20,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:20,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:20,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:20,356 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-12-07 11:26:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:20,567 INFO L93 Difference]: Finished difference Result 325 states and 485 transitions. [2019-12-07 11:26:20,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:20,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 11:26:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:20,569 INFO L225 Difference]: With dead ends: 325 [2019-12-07 11:26:20,569 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 11:26:20,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 11:26:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-12-07 11:26:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 11:26:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-12-07 11:26:20,574 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-12-07 11:26:20,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:20,574 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-12-07 11:26:20,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-12-07 11:26:20,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 11:26:20,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:20,575 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:20,575 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:20,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:20,575 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-12-07 11:26:20,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:20,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206647465] [2019-12-07 11:26:20,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:20,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206647465] [2019-12-07 11:26:20,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:20,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:20,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145848896] [2019-12-07 11:26:20,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:20,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:20,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:20,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:20,603 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-12-07 11:26:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:20,813 INFO L93 Difference]: Finished difference Result 325 states and 483 transitions. [2019-12-07 11:26:20,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:20,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-07 11:26:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:20,814 INFO L225 Difference]: With dead ends: 325 [2019-12-07 11:26:20,815 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 11:26:20,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:20,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 11:26:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-12-07 11:26:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 11:26:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-12-07 11:26:20,818 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-12-07 11:26:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:20,819 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-12-07 11:26:20,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-12-07 11:26:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 11:26:20,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:20,819 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:20,819 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:20,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:20,820 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-12-07 11:26:20,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:20,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026167147] [2019-12-07 11:26:20,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:20,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026167147] [2019-12-07 11:26:20,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:20,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:20,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399109884] [2019-12-07 11:26:20,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:20,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:20,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:20,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:20,853 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-12-07 11:26:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:21,036 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2019-12-07 11:26:21,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:21,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-07 11:26:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:21,037 INFO L225 Difference]: With dead ends: 315 [2019-12-07 11:26:21,037 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 11:26:21,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 11:26:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2019-12-07 11:26:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 11:26:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-12-07 11:26:21,041 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-12-07 11:26:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:21,041 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-12-07 11:26:21,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-12-07 11:26:21,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 11:26:21,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:21,041 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:21,042 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:21,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:21,042 INFO L82 PathProgramCache]: Analyzing trace with hash 719124867, now seen corresponding path program 1 times [2019-12-07 11:26:21,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:21,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444400433] [2019-12-07 11:26:21,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:21,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444400433] [2019-12-07 11:26:21,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:21,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:21,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332000598] [2019-12-07 11:26:21,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:21,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:21,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:21,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:21,085 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-12-07 11:26:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:21,419 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2019-12-07 11:26:21,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:21,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 11:26:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:21,420 INFO L225 Difference]: With dead ends: 403 [2019-12-07 11:26:21,420 INFO L226 Difference]: Without dead ends: 259 [2019-12-07 11:26:21,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-12-07 11:26:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2019-12-07 11:26:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-07 11:26:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-12-07 11:26:21,424 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-12-07 11:26:21,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:21,424 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-12-07 11:26:21,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-12-07 11:26:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 11:26:21,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:21,425 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:21,425 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:21,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:21,425 INFO L82 PathProgramCache]: Analyzing trace with hash -178268411, now seen corresponding path program 1 times [2019-12-07 11:26:21,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:21,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791878009] [2019-12-07 11:26:21,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:21,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791878009] [2019-12-07 11:26:21,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:21,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:21,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902877245] [2019-12-07 11:26:21,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:21,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:21,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:21,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:21,470 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-12-07 11:26:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:21,723 INFO L93 Difference]: Finished difference Result 443 states and 687 transitions. [2019-12-07 11:26:21,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:21,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 11:26:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:21,724 INFO L225 Difference]: With dead ends: 443 [2019-12-07 11:26:21,724 INFO L226 Difference]: Without dead ends: 256 [2019-12-07 11:26:21,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-12-07 11:26:21,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-12-07 11:26:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 11:26:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-12-07 11:26:21,730 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-12-07 11:26:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:21,730 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-12-07 11:26:21,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-12-07 11:26:21,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 11:26:21,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:21,732 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:21,732 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:21,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:21,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2081210466, now seen corresponding path program 1 times [2019-12-07 11:26:21,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:21,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139448237] [2019-12-07 11:26:21,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:21,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139448237] [2019-12-07 11:26:21,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:21,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:21,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448446567] [2019-12-07 11:26:21,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:21,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:21,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:21,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:21,778 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-12-07 11:26:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:22,082 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2019-12-07 11:26:22,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:22,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 11:26:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:22,084 INFO L225 Difference]: With dead ends: 494 [2019-12-07 11:26:22,084 INFO L226 Difference]: Without dead ends: 283 [2019-12-07 11:26:22,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-07 11:26:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2019-12-07 11:26:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 11:26:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-12-07 11:26:22,088 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-12-07 11:26:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:22,088 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-12-07 11:26:22,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-12-07 11:26:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 11:26:22,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:22,089 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:22,089 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2121885216, now seen corresponding path program 1 times [2019-12-07 11:26:22,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:22,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457838207] [2019-12-07 11:26:22,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:22,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457838207] [2019-12-07 11:26:22,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:22,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:22,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470177299] [2019-12-07 11:26:22,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:22,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:22,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:22,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:22,127 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-12-07 11:26:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:22,356 INFO L93 Difference]: Finished difference Result 467 states and 726 transitions. [2019-12-07 11:26:22,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:22,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 11:26:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:22,358 INFO L225 Difference]: With dead ends: 467 [2019-12-07 11:26:22,358 INFO L226 Difference]: Without dead ends: 256 [2019-12-07 11:26:22,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-12-07 11:26:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-12-07 11:26:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 11:26:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-12-07 11:26:22,362 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-12-07 11:26:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:22,362 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-12-07 11:26:22,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-12-07 11:26:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 11:26:22,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:22,363 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:22,363 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:22,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash -314494398, now seen corresponding path program 1 times [2019-12-07 11:26:22,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:22,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795513065] [2019-12-07 11:26:22,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:22,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795513065] [2019-12-07 11:26:22,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:22,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:22,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906823240] [2019-12-07 11:26:22,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:22,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:22,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:22,400 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-12-07 11:26:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:22,663 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2019-12-07 11:26:22,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:22,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 11:26:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:22,665 INFO L225 Difference]: With dead ends: 493 [2019-12-07 11:26:22,665 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 11:26:22,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 11:26:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-12-07 11:26:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 11:26:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-12-07 11:26:22,668 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-12-07 11:26:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:22,669 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-12-07 11:26:22,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-12-07 11:26:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 11:26:22,669 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:22,669 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:22,669 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:22,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:22,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1028699053, now seen corresponding path program 1 times [2019-12-07 11:26:22,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:22,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628939489] [2019-12-07 11:26:22,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:22,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628939489] [2019-12-07 11:26:22,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:22,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:22,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795181841] [2019-12-07 11:26:22,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:22,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:22,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:22,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:22,705 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-12-07 11:26:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:22,957 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2019-12-07 11:26:22,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:22,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 11:26:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:22,959 INFO L225 Difference]: With dead ends: 491 [2019-12-07 11:26:22,959 INFO L226 Difference]: Without dead ends: 280 [2019-12-07 11:26:22,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-07 11:26:22,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2019-12-07 11:26:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 11:26:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-12-07 11:26:22,963 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-12-07 11:26:22,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:22,963 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-12-07 11:26:22,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-12-07 11:26:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 11:26:22,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:22,964 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:22,964 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1978047213, now seen corresponding path program 1 times [2019-12-07 11:26:22,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:22,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610888011] [2019-12-07 11:26:22,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:23,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610888011] [2019-12-07 11:26:23,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:23,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:23,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255544555] [2019-12-07 11:26:23,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:23,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:23,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:23,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:23,005 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-12-07 11:26:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:23,284 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2019-12-07 11:26:23,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:23,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 11:26:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:23,286 INFO L225 Difference]: With dead ends: 490 [2019-12-07 11:26:23,286 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 11:26:23,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 11:26:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-12-07 11:26:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 11:26:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-12-07 11:26:23,297 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-12-07 11:26:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:23,298 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-12-07 11:26:23,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-12-07 11:26:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 11:26:23,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:23,298 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:23,298 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:23,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash 523516374, now seen corresponding path program 1 times [2019-12-07 11:26:23,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:23,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169453441] [2019-12-07 11:26:23,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 11:26:23,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169453441] [2019-12-07 11:26:23,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:23,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:26:23,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344695292] [2019-12-07 11:26:23,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:26:23,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:23,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:26:23,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:23,343 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-12-07 11:26:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:23,638 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-12-07 11:26:23,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:26:23,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-07 11:26:23,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:23,640 INFO L225 Difference]: With dead ends: 462 [2019-12-07 11:26:23,640 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 11:26:23,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:26:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 11:26:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-12-07 11:26:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:26:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-12-07 11:26:23,644 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-12-07 11:26:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:23,644 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-12-07 11:26:23,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:26:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-12-07 11:26:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 11:26:23,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:23,644 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:23,645 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:23,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2005350993, now seen corresponding path program 1 times [2019-12-07 11:26:23,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:23,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353105650] [2019-12-07 11:26:23,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:23,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353105650] [2019-12-07 11:26:23,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:23,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:23,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426739026] [2019-12-07 11:26:23,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:23,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:23,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:23,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:23,677 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-12-07 11:26:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:23,886 INFO L93 Difference]: Finished difference Result 504 states and 766 transitions. [2019-12-07 11:26:23,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:23,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 11:26:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:23,888 INFO L225 Difference]: With dead ends: 504 [2019-12-07 11:26:23,888 INFO L226 Difference]: Without dead ends: 273 [2019-12-07 11:26:23,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-07 11:26:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 250. [2019-12-07 11:26:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:26:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-12-07 11:26:23,894 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-12-07 11:26:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:23,894 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-12-07 11:26:23,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-12-07 11:26:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 11:26:23,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:23,895 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:23,895 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:23,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1056002833, now seen corresponding path program 1 times [2019-12-07 11:26:23,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:23,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490047529] [2019-12-07 11:26:23,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:23,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490047529] [2019-12-07 11:26:23,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:23,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:23,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532409029] [2019-12-07 11:26:23,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:23,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:23,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:23,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:23,938 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-12-07 11:26:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:24,154 INFO L93 Difference]: Finished difference Result 503 states and 763 transitions. [2019-12-07 11:26:24,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:24,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 11:26:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:24,156 INFO L225 Difference]: With dead ends: 503 [2019-12-07 11:26:24,156 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 11:26:24,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 11:26:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-12-07 11:26:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:26:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-12-07 11:26:24,161 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-12-07 11:26:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:24,161 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-12-07 11:26:24,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-12-07 11:26:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:26:24,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:24,162 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:24,162 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:24,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:24,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1449434210, now seen corresponding path program 1 times [2019-12-07 11:26:24,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:24,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360853223] [2019-12-07 11:26:24,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:24,202 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:24,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360853223] [2019-12-07 11:26:24,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:24,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:24,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370204315] [2019-12-07 11:26:24,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:24,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:24,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:24,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:24,203 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-12-07 11:26:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:24,479 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2019-12-07 11:26:24,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:24,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 11:26:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:24,481 INFO L225 Difference]: With dead ends: 530 [2019-12-07 11:26:24,481 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 11:26:24,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 11:26:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-12-07 11:26:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:26:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-12-07 11:26:24,487 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-12-07 11:26:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:24,488 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-12-07 11:26:24,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-12-07 11:26:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:26:24,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:24,489 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:24,489 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:24,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1015705124, now seen corresponding path program 1 times [2019-12-07 11:26:24,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:24,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032854486] [2019-12-07 11:26:24,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:24,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032854486] [2019-12-07 11:26:24,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:24,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:24,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201427164] [2019-12-07 11:26:24,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:24,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:24,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:24,531 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-12-07 11:26:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:24,742 INFO L93 Difference]: Finished difference Result 503 states and 759 transitions. [2019-12-07 11:26:24,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:24,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 11:26:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:24,744 INFO L225 Difference]: With dead ends: 503 [2019-12-07 11:26:24,744 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 11:26:24,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 11:26:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-12-07 11:26:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:26:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-12-07 11:26:24,750 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-12-07 11:26:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:24,750 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-12-07 11:26:24,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-12-07 11:26:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 11:26:24,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:24,751 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:24,751 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash 542245225, now seen corresponding path program 1 times [2019-12-07 11:26:24,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:24,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015788133] [2019-12-07 11:26:24,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:24,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015788133] [2019-12-07 11:26:24,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:24,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:24,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706102782] [2019-12-07 11:26:24,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:24,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:24,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:24,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:24,790 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-12-07 11:26:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:25,053 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2019-12-07 11:26:25,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:25,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 11:26:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:25,055 INFO L225 Difference]: With dead ends: 530 [2019-12-07 11:26:25,055 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 11:26:25,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 11:26:25,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-12-07 11:26:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:26:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-12-07 11:26:25,059 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-12-07 11:26:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:25,059 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-12-07 11:26:25,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-12-07 11:26:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 11:26:25,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:25,060 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:25,060 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:25,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:25,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1102945003, now seen corresponding path program 1 times [2019-12-07 11:26:25,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:25,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974622288] [2019-12-07 11:26:25,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:25,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974622288] [2019-12-07 11:26:25,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:25,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:25,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198506781] [2019-12-07 11:26:25,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:25,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:25,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:25,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:25,093 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-12-07 11:26:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:25,286 INFO L93 Difference]: Finished difference Result 503 states and 755 transitions. [2019-12-07 11:26:25,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:25,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 11:26:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:25,287 INFO L225 Difference]: With dead ends: 503 [2019-12-07 11:26:25,287 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 11:26:25,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 11:26:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-12-07 11:26:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:26:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-12-07 11:26:25,292 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-12-07 11:26:25,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:25,292 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-12-07 11:26:25,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-12-07 11:26:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 11:26:25,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:25,293 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:25,293 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:25,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:25,293 INFO L82 PathProgramCache]: Analyzing trace with hash 952064921, now seen corresponding path program 1 times [2019-12-07 11:26:25,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:25,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145085408] [2019-12-07 11:26:25,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:25,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145085408] [2019-12-07 11:26:25,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:25,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:25,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437084256] [2019-12-07 11:26:25,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:25,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:25,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:25,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:25,328 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-12-07 11:26:25,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:25,597 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2019-12-07 11:26:25,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:25,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 11:26:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:25,599 INFO L225 Difference]: With dead ends: 530 [2019-12-07 11:26:25,599 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 11:26:25,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:25,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 11:26:25,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-12-07 11:26:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:26:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-12-07 11:26:25,603 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-12-07 11:26:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:25,604 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-12-07 11:26:25,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-12-07 11:26:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 11:26:25,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:25,604 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:25,604 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:25,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1153888855, now seen corresponding path program 1 times [2019-12-07 11:26:25,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:25,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592584393] [2019-12-07 11:26:25,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:25,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592584393] [2019-12-07 11:26:25,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:25,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:25,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148864609] [2019-12-07 11:26:25,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:25,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:25,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:25,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:25,639 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-12-07 11:26:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:25,847 INFO L93 Difference]: Finished difference Result 503 states and 751 transitions. [2019-12-07 11:26:25,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:25,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 11:26:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:25,848 INFO L225 Difference]: With dead ends: 503 [2019-12-07 11:26:25,848 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 11:26:25,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 11:26:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-12-07 11:26:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:26:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-12-07 11:26:25,853 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-12-07 11:26:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:25,853 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-12-07 11:26:25,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-12-07 11:26:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 11:26:25,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:25,854 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:25,854 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:25,854 INFO L82 PathProgramCache]: Analyzing trace with hash -431127036, now seen corresponding path program 1 times [2019-12-07 11:26:25,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:25,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042927894] [2019-12-07 11:26:25,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:25,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042927894] [2019-12-07 11:26:25,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:25,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:25,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309391128] [2019-12-07 11:26:25,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:25,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:25,886 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-12-07 11:26:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:26,131 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2019-12-07 11:26:26,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:26,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 11:26:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:26,133 INFO L225 Difference]: With dead ends: 520 [2019-12-07 11:26:26,133 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 11:26:26,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 11:26:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-12-07 11:26:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:26:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-12-07 11:26:26,138 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-12-07 11:26:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:26,138 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-12-07 11:26:26,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:26,138 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-12-07 11:26:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 11:26:26,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:26,139 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:26,139 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:26,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1530447622, now seen corresponding path program 1 times [2019-12-07 11:26:26,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:26,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175934967] [2019-12-07 11:26:26,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:26,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175934967] [2019-12-07 11:26:26,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:26,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:26,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228879255] [2019-12-07 11:26:26,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:26,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:26,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:26,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:26,176 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-12-07 11:26:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:26,374 INFO L93 Difference]: Finished difference Result 493 states and 735 transitions. [2019-12-07 11:26:26,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:26,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 11:26:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:26,375 INFO L225 Difference]: With dead ends: 493 [2019-12-07 11:26:26,375 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 11:26:26,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 11:26:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2019-12-07 11:26:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:26:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-12-07 11:26:26,379 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-12-07 11:26:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:26,379 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-12-07 11:26:26,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-12-07 11:26:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 11:26:26,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:26,380 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:26,380 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:26,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:26,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1853395595, now seen corresponding path program 1 times [2019-12-07 11:26:26,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:26,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757660693] [2019-12-07 11:26:26,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:26:26,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757660693] [2019-12-07 11:26:26,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:26,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:26:26,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666413504] [2019-12-07 11:26:26,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:26,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:26,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:26,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:26,415 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-12-07 11:26:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:26,676 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2019-12-07 11:26:26,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:26,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-12-07 11:26:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:26,678 INFO L225 Difference]: With dead ends: 520 [2019-12-07 11:26:26,678 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 11:26:26,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:26:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 11:26:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-12-07 11:26:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:26:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-12-07 11:26:26,684 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-12-07 11:26:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:26,684 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-12-07 11:26:26,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-12-07 11:26:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 11:26:26,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:26,685 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:26,685 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash 167215757, now seen corresponding path program 1 times [2019-12-07 11:26:26,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:26,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676088417] [2019-12-07 11:26:26,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 11:26:26,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676088417] [2019-12-07 11:26:26,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:26,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:26:26,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484213473] [2019-12-07 11:26:26,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:26:26,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:26:26,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:26:26,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:26:26,737 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-12-07 11:26:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:26,760 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-12-07 11:26:26,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:26:26,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-12-07 11:26:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:26,762 INFO L225 Difference]: With dead ends: 710 [2019-12-07 11:26:26,762 INFO L226 Difference]: Without dead ends: 479 [2019-12-07 11:26:26,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:26:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-12-07 11:26:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-12-07 11:26:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-12-07 11:26:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-12-07 11:26:26,770 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-12-07 11:26:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:26,770 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-12-07 11:26:26,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:26:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-12-07 11:26:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 11:26:26,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:26,771 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:26,771 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:26,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:26,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2019-12-07 11:26:26,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:26:26,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353066185] [2019-12-07 11:26:26,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:26:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:26:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:26:26,914 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:26:26,914 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:26:26,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:26:26 BoogieIcfgContainer [2019-12-07 11:26:26,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:26:26,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:26:26,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:26:26,980 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:26:26,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:26:15" (3/4) ... [2019-12-07 11:26:26,983 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:26:26,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:26:26,984 INFO L168 Benchmark]: Toolchain (without parser) took 12189.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 275.3 MB). Free memory was 937.2 MB in the beginning and 1.2 GB in the end (delta: -245.9 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:26,985 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:26:26,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -127.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:26,985 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:26:26,985 INFO L168 Benchmark]: Boogie Preprocessor took 56.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:26,985 INFO L168 Benchmark]: RCFGBuilder took 693.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.9 MB in the end (delta: 92.8 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:26,986 INFO L168 Benchmark]: TraceAbstraction took 10982.66 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 959.9 MB in the beginning and 1.2 GB in the end (delta: -223.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:26:26,986 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:26:26,987 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 395.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -127.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.75 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 56.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 693.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.9 MB in the end (delta: 92.8 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10982.66 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 959.9 MB in the beginning and 1.2 GB in the end (delta: -223.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.12 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={9:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={9:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={9:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={9:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={9:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={9:0}] [L1351] COND FALSE !(ret <= 0) [L1356] s->hit VAL [init=1, SSLv3_server_data={9:0}] [L1356] COND TRUE s->hit [L1357] s->state = 8656 VAL [init=1, SSLv3_server_data={9:0}] [L1361] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] COND FALSE !(! tmp___9) [L1561] ret = __VERIFIER_nondet_int() [L1562] COND TRUE blastFlag == 2 [L1563] blastFlag = 3 VAL [init=1, SSLv3_server_data={9:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={9:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 10.8s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7109 SDtfs, 2139 SDslu, 10637 SDs, 0 SdLazy, 6863 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 76 SyntacticMatches, 29 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 941 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 733119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 11:26:28,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:26:28,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:26:28,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:26:28,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:26:28,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:26:28,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:26:28,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:26:28,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:26:28,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:26:28,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:26:28,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:26:28,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:26:28,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:26:28,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:26:28,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:26:28,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:26:28,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:26:28,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:26:28,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:26:28,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:26:28,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:26:28,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:26:28,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:26:28,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:26:28,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:26:28,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:26:28,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:26:28,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:26:28,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:26:28,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:26:28,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:26:28,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:26:28,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:26:28,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:26:28,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:26:28,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:26:28,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:26:28,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:26:28,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:26:28,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:26:28,470 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 11:26:28,480 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:26:28,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:26:28,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:26:28,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:26:28,482 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:26:28,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:26:28,482 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:26:28,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:26:28,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:26:28,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:26:28,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:26:28,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:26:28,483 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 11:26:28,483 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 11:26:28,483 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:26:28,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:26:28,484 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:26:28,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:26:28,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:26:28,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:26:28,484 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:26:28,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:26:28,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:26:28,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:26:28,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:26:28,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:26:28,485 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 11:26:28,485 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 11:26:28,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:26:28,485 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:26:28,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:26:28,486 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_2fe9ad6e-a730-4f55-85cf-5dc157286d78/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 -> 1952eae46575e60399f761afaedbe356b8f81a96 [2019-12-07 11:26:28,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:26:28,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:26:28,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:26:28,655 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:26:28,655 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:26:28,655 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-12-07 11:26:28,692 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/data/20d749911/5cb44ecdf4f74e2abe6ccd38267e6040/FLAG8c8a3232d [2019-12-07 11:26:29,201 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:26:29,201 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-12-07 11:26:29,214 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/data/20d749911/5cb44ecdf4f74e2abe6ccd38267e6040/FLAG8c8a3232d [2019-12-07 11:26:29,674 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/data/20d749911/5cb44ecdf4f74e2abe6ccd38267e6040 [2019-12-07 11:26:29,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:26:29,677 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:26:29,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:26:29,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:26:29,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:26:29,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:26:29" (1/1) ... [2019-12-07 11:26:29,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258d581a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:29, skipping insertion in model container [2019-12-07 11:26:29,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:26:29" (1/1) ... [2019-12-07 11:26:29,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:26:29,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:26:29,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:26:30,007 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:26:30,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:26:30,093 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:26:30,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:30 WrapperNode [2019-12-07 11:26:30,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:26:30,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:26:30,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:26:30,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:26:30,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:30" (1/1) ... [2019-12-07 11:26:30,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:30" (1/1) ... [2019-12-07 11:26:30,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:26:30,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:26:30,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:26:30,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:26:30,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:30" (1/1) ... [2019-12-07 11:26:30,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:30" (1/1) ... [2019-12-07 11:26:30,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:30" (1/1) ... [2019-12-07 11:26:30,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:30" (1/1) ... [2019-12-07 11:26:30,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:30" (1/1) ... [2019-12-07 11:26:30,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:30" (1/1) ... [2019-12-07 11:26:30,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:30" (1/1) ... [2019-12-07 11:26:30,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:26:30,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:26:30,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:26:30,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:26:30,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:26:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:26:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:26:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 11:26:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:26:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:26:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:26:30,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:26:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 11:26:30,380 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:26:32,458 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 11:26:32,458 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 11:26:32,459 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:26:32,459 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:26:32,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:26:32 BoogieIcfgContainer [2019-12-07 11:26:32,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:26:32,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:26:32,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:26:32,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:26:32,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:26:29" (1/3) ... [2019-12-07 11:26:32,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240f55c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:26:32, skipping insertion in model container [2019-12-07 11:26:32,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:26:30" (2/3) ... [2019-12-07 11:26:32,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240f55c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:26:32, skipping insertion in model container [2019-12-07 11:26:32,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:26:32" (3/3) ... [2019-12-07 11:26:32,465 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2019-12-07 11:26:32,471 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:26:32,476 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:26:32,484 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:26:32,501 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:26:32,501 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:26:32,501 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:26:32,501 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:26:32,501 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:26:32,501 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:26:32,501 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:26:32,502 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:26:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-12-07 11:26:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:26:32,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:32,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:32,521 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:32,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:32,525 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-12-07 11:26:32,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:26:32,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341379112] [2019-12-07 11:26:32,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 11:26:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:32,663 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:26:32,669 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:26:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:32,699 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:26:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:32,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341379112] [2019-12-07 11:26:32,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:32,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:26:32,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268962415] [2019-12-07 11:26:32,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:32,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:26:32,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:32,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:32,734 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-12-07 11:26:32,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:32,816 INFO L93 Difference]: Finished difference Result 537 states and 912 transitions. [2019-12-07 11:26:32,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:32,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 11:26:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:32,828 INFO L225 Difference]: With dead ends: 537 [2019-12-07 11:26:32,828 INFO L226 Difference]: Without dead ends: 363 [2019-12-07 11:26:32,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-07 11:26:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2019-12-07 11:26:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-07 11:26:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 551 transitions. [2019-12-07 11:26:32,878 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 551 transitions. Word has length 45 [2019-12-07 11:26:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:32,878 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 551 transitions. [2019-12-07 11:26:32,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:32,878 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2019-12-07 11:26:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 11:26:32,883 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:32,883 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:33,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 11:26:33,085 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:33,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1786835122, now seen corresponding path program 1 times [2019-12-07 11:26:33,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:26:33,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819873533] [2019-12-07 11:26:33,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 11:26:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:33,290 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:26:33,294 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:26:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:33,318 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:26:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:26:33,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819873533] [2019-12-07 11:26:33,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:33,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:26:33,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240991395] [2019-12-07 11:26:33,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:26:33,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:26:33,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:26:33,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:33,341 INFO L87 Difference]: Start difference. First operand 363 states and 551 transitions. Second operand 4 states. [2019-12-07 11:26:33,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:33,711 INFO L93 Difference]: Finished difference Result 833 states and 1271 transitions. [2019-12-07 11:26:33,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:26:33,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-07 11:26:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:33,715 INFO L225 Difference]: With dead ends: 833 [2019-12-07 11:26:33,715 INFO L226 Difference]: Without dead ends: 597 [2019-12-07 11:26:33,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:26:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-12-07 11:26:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-12-07 11:26:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-07 11:26:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 905 transitions. [2019-12-07 11:26:33,748 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 905 transitions. Word has length 103 [2019-12-07 11:26:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:33,748 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 905 transitions. [2019-12-07 11:26:33,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:26:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 905 transitions. [2019-12-07 11:26:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 11:26:33,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:33,751 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:33,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 11:26:33,952 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:33,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:33,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2019-12-07 11:26:33,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:26:33,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982582977] [2019-12-07 11:26:33,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 11:26:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:26:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:26:34,695 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 11:26:34,695 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:26:34,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 11:26:34,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:26:34 BoogieIcfgContainer [2019-12-07 11:26:34,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:26:34,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:26:34,998 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:26:34,999 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:26:34,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:26:32" (3/4) ... [2019-12-07 11:26:35,000 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:26:35,076 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2fe9ad6e-a730-4f55-85cf-5dc157286d78/bin/uautomizer/witness.graphml [2019-12-07 11:26:35,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:26:35,078 INFO L168 Benchmark]: Toolchain (without parser) took 5400.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:35,078 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:26:35,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:35,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:35,079 INFO L168 Benchmark]: Boogie Preprocessor took 53.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:35,079 INFO L168 Benchmark]: RCFGBuilder took 2256.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 991.0 MB in the end (delta: 91.3 MB). Peak memory consumption was 91.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:35,079 INFO L168 Benchmark]: TraceAbstraction took 2537.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 991.0 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:26:35,079 INFO L168 Benchmark]: Witness Printer took 78.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:26:35,081 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2256.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 991.0 MB in the end (delta: 91.3 MB). Peak memory consumption was 91.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2537.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 991.0 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 78.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1702]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={15:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={15:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={15:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={15:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={15:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={15:0}] [L1351] COND FALSE !(ret <= 0) [L1356] s->hit VAL [init=1, SSLv3_server_data={15:0}] [L1356] COND TRUE s->hit [L1357] s->state = 8656 VAL [init=1, SSLv3_server_data={15:0}] [L1361] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1229] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] COND FALSE !(! tmp___9) [L1561] ret = __VERIFIER_nondet_int() [L1562] COND TRUE blastFlag == 2 [L1563] blastFlag = 3 VAL [init=1, SSLv3_server_data={15:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={15:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={15:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 588 SDtfs, 657 SDslu, 785 SDs, 0 SdLazy, 50 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=597occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 74336 SizeOfPredicates, 1 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...