./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.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_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/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 09d651c8899349531493fefbd169797d0022b4a3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/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 09d651c8899349531493fefbd169797d0022b4a3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 18:05:43,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:05:43,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:05:43,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:05:43,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:05:43,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:05:43,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:05:43,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:05:43,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:05:43,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:05:43,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:05:43,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:05:43,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:05:43,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:05:43,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:05:43,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:05:43,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:05:43,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:05:43,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:05:43,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:05:43,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:05:43,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:05:43,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:05:43,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:05:43,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:05:43,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:05:43,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:05:43,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:05:43,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:05:43,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:05:43,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:05:43,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:05:43,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:05:43,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:05:43,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:05:43,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:05:43,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:05:43,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:05:43,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:05:43,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:05:43,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:05:43,498 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:05:43,507 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:05:43,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:05:43,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:05:43,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:05:43,508 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:05:43,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:05:43,508 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:05:43,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:05:43,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:05:43,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:05:43,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:05:43,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:05:43,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:05:43,509 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:05:43,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:05:43,509 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:05:43,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:05:43,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:05:43,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:05:43,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:05:43,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:05:43,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:05:43,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:05:43,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:05:43,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:05:43,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:05:43,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:05:43,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:05:43,510 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:05:43,510 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_d7ee4b91-1d91-46a9-982d-9dd9c4403585/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 -> 09d651c8899349531493fefbd169797d0022b4a3 [2019-12-07 18:05:43,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:05:43,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:05:43,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:05:43,624 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:05:43,625 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:05:43,625 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-12-07 18:05:43,667 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/data/6cd9963c1/9cf59f9ec3be42cf849cc5756cb2b320/FLAG220eeaca2 [2019-12-07 18:05:44,120 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:05:44,121 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-12-07 18:05:44,133 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/data/6cd9963c1/9cf59f9ec3be42cf849cc5756cb2b320/FLAG220eeaca2 [2019-12-07 18:05:44,441 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/data/6cd9963c1/9cf59f9ec3be42cf849cc5756cb2b320 [2019-12-07 18:05:44,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:05:44,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:05:44,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:05:44,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:05:44,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:05:44,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:05:44" (1/1) ... [2019-12-07 18:05:44,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39314f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44, skipping insertion in model container [2019-12-07 18:05:44,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:05:44" (1/1) ... [2019-12-07 18:05:44,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:05:44,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:05:44,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:05:44,805 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:05:44,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:05:44,882 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:05:44,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44 WrapperNode [2019-12-07 18:05:44,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:05:44,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:05:44,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:05:44,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:05:44,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44" (1/1) ... [2019-12-07 18:05:44,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44" (1/1) ... [2019-12-07 18:05:44,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:05:44,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:05:44,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:05:44,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:05:44,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44" (1/1) ... [2019-12-07 18:05:44,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44" (1/1) ... [2019-12-07 18:05:44,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44" (1/1) ... [2019-12-07 18:05:44,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44" (1/1) ... [2019-12-07 18:05:44,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44" (1/1) ... [2019-12-07 18:05:44,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44" (1/1) ... [2019-12-07 18:05:44,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44" (1/1) ... [2019-12-07 18:05:44,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:05:44,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:05:44,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:05:44,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:05:44,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/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 18:05:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:05:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:05:45,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:05:45,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:05:45,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:05:45,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:05:45,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:05:45,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:05:45,149 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:05:45,627 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 18:05:45,627 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 18:05:45,628 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:05:45,629 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:05:45,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:05:45 BoogieIcfgContainer [2019-12-07 18:05:45,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:05:45,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:05:45,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:05:45,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:05:45,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:05:44" (1/3) ... [2019-12-07 18:05:45,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3845c220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:05:45, skipping insertion in model container [2019-12-07 18:05:45,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:44" (2/3) ... [2019-12-07 18:05:45,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3845c220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:05:45, skipping insertion in model container [2019-12-07 18:05:45,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:05:45" (3/3) ... [2019-12-07 18:05:45,636 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2019-12-07 18:05:45,645 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:05:45,651 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:05:45,659 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:05:45,678 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:05:45,678 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:05:45,678 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:05:45,678 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:05:45,678 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:05:45,678 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:05:45,678 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:05:45,678 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:05:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-12-07 18:05:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:05:45,699 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:45,700 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 18:05:45,700 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:45,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:45,704 INFO L82 PathProgramCache]: Analyzing trace with hash 522837677, now seen corresponding path program 1 times [2019-12-07 18:05:45,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:45,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841454912] [2019-12-07 18:05:45,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:45,930 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 18:05:45,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841454912] [2019-12-07 18:05:45,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:45,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:45,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184415460] [2019-12-07 18:05:45,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:45,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:45,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:45,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:45,947 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-12-07 18:05:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:46,281 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-12-07 18:05:46,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:46,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 18:05:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:46,291 INFO L225 Difference]: With dead ends: 313 [2019-12-07 18:05:46,291 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 18:05:46,295 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 18:05:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 18:05:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-12-07 18:05:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 18:05:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-12-07 18:05:46,334 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-12-07 18:05:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:46,334 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-12-07 18:05:46,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-12-07 18:05:46,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:05:46,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:46,337 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 18:05:46,337 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:46,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:46,337 INFO L82 PathProgramCache]: Analyzing trace with hash -428665669, now seen corresponding path program 1 times [2019-12-07 18:05:46,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:46,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532294916] [2019-12-07 18:05:46,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:46,420 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 18:05:46,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532294916] [2019-12-07 18:05:46,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:46,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:46,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606773275] [2019-12-07 18:05:46,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:46,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:46,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:46,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:46,422 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-12-07 18:05:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:46,664 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-12-07 18:05:46,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:46,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 18:05:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:46,666 INFO L225 Difference]: With dead ends: 280 [2019-12-07 18:05:46,666 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 18:05:46,667 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 18:05:46,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 18:05:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-12-07 18:05:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 18:05:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-12-07 18:05:46,675 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-12-07 18:05:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:46,676 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-12-07 18:05:46,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-12-07 18:05:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:05:46,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:46,678 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 18:05:46,678 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:46,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:46,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1858029875, now seen corresponding path program 1 times [2019-12-07 18:05:46,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:46,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631430728] [2019-12-07 18:05:46,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:46,746 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 18:05:46,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631430728] [2019-12-07 18:05:46,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:46,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:46,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22330884] [2019-12-07 18:05:46,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:46,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:46,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:46,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:46,748 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-12-07 18:05:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:46,958 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-12-07 18:05:46,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:46,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 18:05:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:46,960 INFO L225 Difference]: With dead ends: 279 [2019-12-07 18:05:46,960 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 18:05:46,961 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 18:05:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 18:05:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-12-07 18:05:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 18:05:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-12-07 18:05:46,969 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-12-07 18:05:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:46,969 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-12-07 18:05:46,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-12-07 18:05:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:05:46,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:46,972 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 18:05:46,972 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:46,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash -514836424, now seen corresponding path program 1 times [2019-12-07 18:05:46,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:46,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053859530] [2019-12-07 18:05:46,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:47,025 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 18:05:47,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053859530] [2019-12-07 18:05:47,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:47,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:47,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867901684] [2019-12-07 18:05:47,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:47,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:47,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:47,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:47,026 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-12-07 18:05:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:47,218 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-12-07 18:05:47,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:47,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 18:05:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:47,219 INFO L225 Difference]: With dead ends: 277 [2019-12-07 18:05:47,219 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 18:05:47,220 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 18:05:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 18:05:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-12-07 18:05:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 18:05:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-12-07 18:05:47,226 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-12-07 18:05:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:47,226 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-12-07 18:05:47,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-12-07 18:05:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:05:47,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:47,227 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 18:05:47,227 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash 434511736, now seen corresponding path program 1 times [2019-12-07 18:05:47,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:47,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79848458] [2019-12-07 18:05:47,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:47,269 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 18:05:47,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79848458] [2019-12-07 18:05:47,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:47,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:47,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995144523] [2019-12-07 18:05:47,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:47,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:47,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:47,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:47,271 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-12-07 18:05:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:47,456 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-12-07 18:05:47,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:47,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 18:05:47,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:47,458 INFO L225 Difference]: With dead ends: 276 [2019-12-07 18:05:47,458 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 18:05:47,458 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 18:05:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 18:05:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-12-07 18:05:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 18:05:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-12-07 18:05:47,463 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-12-07 18:05:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:47,463 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-12-07 18:05:47,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-12-07 18:05:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:05:47,464 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:47,464 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 18:05:47,464 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:47,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1020019103, now seen corresponding path program 1 times [2019-12-07 18:05:47,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:47,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712790486] [2019-12-07 18:05:47,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:47,501 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 18:05:47,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712790486] [2019-12-07 18:05:47,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:47,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:47,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692910289] [2019-12-07 18:05:47,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:47,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:47,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:47,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:47,503 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-12-07 18:05:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:47,697 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-12-07 18:05:47,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:47,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 18:05:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:47,698 INFO L225 Difference]: With dead ends: 276 [2019-12-07 18:05:47,698 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 18:05:47,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:05:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 18:05:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-12-07 18:05:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 18:05:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-12-07 18:05:47,704 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-12-07 18:05:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:47,704 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-12-07 18:05:47,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-12-07 18:05:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 18:05:47,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:47,705 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 18:05:47,705 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:47,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash 321491268, now seen corresponding path program 1 times [2019-12-07 18:05:47,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:47,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401162578] [2019-12-07 18:05:47,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:47,751 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 18:05:47,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401162578] [2019-12-07 18:05:47,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:47,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:47,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972511181] [2019-12-07 18:05:47,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:47,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:47,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:47,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:47,753 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-12-07 18:05:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:47,957 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-12-07 18:05:47,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:47,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 18:05:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:47,959 INFO L225 Difference]: With dead ends: 276 [2019-12-07 18:05:47,959 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 18:05:47,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 18:05:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 18:05:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-12-07 18:05:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 18:05:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-12-07 18:05:47,962 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-12-07 18:05:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:47,963 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-12-07 18:05:47,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-12-07 18:05:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 18:05:47,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:47,963 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 18:05:47,963 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:47,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:47,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1080156986, now seen corresponding path program 1 times [2019-12-07 18:05:47,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:47,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472619202] [2019-12-07 18:05:47,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:48,006 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 18:05:48,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472619202] [2019-12-07 18:05:48,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:48,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:48,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630449654] [2019-12-07 18:05:48,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:48,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:48,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:48,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:48,008 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-12-07 18:05:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:48,222 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-12-07 18:05:48,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:48,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 18:05:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:48,223 INFO L225 Difference]: With dead ends: 276 [2019-12-07 18:05:48,223 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 18:05:48,224 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 18:05:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 18:05:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-12-07 18:05:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 18:05:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-12-07 18:05:48,227 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-12-07 18:05:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:48,227 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-12-07 18:05:48,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-12-07 18:05:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 18:05:48,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:48,228 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 18:05:48,228 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:48,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:48,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1620376695, now seen corresponding path program 1 times [2019-12-07 18:05:48,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:48,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068221406] [2019-12-07 18:05:48,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:48,258 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 18:05:48,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068221406] [2019-12-07 18:05:48,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:48,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:48,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877823028] [2019-12-07 18:05:48,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:48,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:48,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:48,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:48,259 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-12-07 18:05:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:48,418 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-12-07 18:05:48,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:48,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 18:05:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:48,419 INFO L225 Difference]: With dead ends: 266 [2019-12-07 18:05:48,419 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 18:05:48,420 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 18:05:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 18:05:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-12-07 18:05:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 18:05:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-12-07 18:05:48,423 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-12-07 18:05:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:48,423 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-12-07 18:05:48,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-12-07 18:05:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 18:05:48,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:48,424 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 18:05:48,424 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:48,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1220225295, now seen corresponding path program 1 times [2019-12-07 18:05:48,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:48,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745081591] [2019-12-07 18:05:48,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:48,455 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 18:05:48,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745081591] [2019-12-07 18:05:48,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:48,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:48,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960990529] [2019-12-07 18:05:48,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:48,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:48,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:48,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:48,456 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-12-07 18:05:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:48,652 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2019-12-07 18:05:48,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:48,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 18:05:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:48,654 INFO L225 Difference]: With dead ends: 306 [2019-12-07 18:05:48,654 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 18:05:48,654 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 18:05:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 18:05:48,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-12-07 18:05:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 18:05:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-12-07 18:05:48,658 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-12-07 18:05:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:48,658 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-12-07 18:05:48,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-12-07 18:05:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 18:05:48,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:48,659 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 18:05:48,659 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:48,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1563120905, now seen corresponding path program 1 times [2019-12-07 18:05:48,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:48,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488905427] [2019-12-07 18:05:48,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:48,693 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 18:05:48,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488905427] [2019-12-07 18:05:48,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:48,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:48,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165692629] [2019-12-07 18:05:48,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:48,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:48,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:48,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:48,694 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-12-07 18:05:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:48,904 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2019-12-07 18:05:48,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:48,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 18:05:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:48,905 INFO L225 Difference]: With dead ends: 328 [2019-12-07 18:05:48,906 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 18:05:48,906 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 18:05:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 18:05:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-12-07 18:05:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 18:05:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-12-07 18:05:48,909 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-12-07 18:05:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:48,909 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-12-07 18:05:48,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-12-07 18:05:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 18:05:48,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:48,910 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 18:05:48,910 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:48,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1628563473, now seen corresponding path program 1 times [2019-12-07 18:05:48,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:48,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467646869] [2019-12-07 18:05:48,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:48,938 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 18:05:48,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467646869] [2019-12-07 18:05:48,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:48,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:48,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974350482] [2019-12-07 18:05:48,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:48,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:48,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:48,939 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-12-07 18:05:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:49,151 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2019-12-07 18:05:49,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:49,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 18:05:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:49,152 INFO L225 Difference]: With dead ends: 327 [2019-12-07 18:05:49,153 INFO L226 Difference]: Without dead ends: 183 [2019-12-07 18:05:49,153 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 18:05:49,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-12-07 18:05:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-12-07 18:05:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 18:05:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-12-07 18:05:49,156 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-12-07 18:05:49,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:49,157 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-12-07 18:05:49,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-12-07 18:05:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 18:05:49,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:49,157 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 18:05:49,157 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:49,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1323210372, now seen corresponding path program 1 times [2019-12-07 18:05:49,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:49,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130310710] [2019-12-07 18:05:49,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:49,187 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 18:05:49,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130310710] [2019-12-07 18:05:49,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:49,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:49,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974028878] [2019-12-07 18:05:49,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:49,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:49,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:49,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:49,188 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-12-07 18:05:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:49,424 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2019-12-07 18:05:49,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:49,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 18:05:49,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:49,426 INFO L225 Difference]: With dead ends: 325 [2019-12-07 18:05:49,426 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 18:05:49,426 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 18:05:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 18:05:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-12-07 18:05:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 18:05:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-12-07 18:05:49,430 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-12-07 18:05:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:49,430 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-12-07 18:05:49,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-12-07 18:05:49,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 18:05:49,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:49,431 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 18:05:49,431 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:49,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:49,431 INFO L82 PathProgramCache]: Analyzing trace with hash -373862212, now seen corresponding path program 1 times [2019-12-07 18:05:49,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:49,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865505576] [2019-12-07 18:05:49,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:49,465 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 18:05:49,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865505576] [2019-12-07 18:05:49,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:49,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:49,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297692895] [2019-12-07 18:05:49,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:49,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:49,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:49,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:49,467 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-12-07 18:05:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:49,735 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2019-12-07 18:05:49,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:49,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 18:05:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:49,736 INFO L225 Difference]: With dead ends: 324 [2019-12-07 18:05:49,736 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 18:05:49,737 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 18:05:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 18:05:49,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-12-07 18:05:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 18:05:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-12-07 18:05:49,740 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-12-07 18:05:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:49,740 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-12-07 18:05:49,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-12-07 18:05:49,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 18:05:49,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:49,741 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 18:05:49,741 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:49,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:49,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1828393051, now seen corresponding path program 1 times [2019-12-07 18:05:49,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:49,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796478370] [2019-12-07 18:05:49,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:49,768 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 18:05:49,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796478370] [2019-12-07 18:05:49,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:49,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:49,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418599074] [2019-12-07 18:05:49,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:49,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:49,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:49,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:49,770 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-12-07 18:05:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:49,993 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2019-12-07 18:05:49,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:49,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 18:05:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:49,994 INFO L225 Difference]: With dead ends: 324 [2019-12-07 18:05:49,994 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 18:05:49,995 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 18:05:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 18:05:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-12-07 18:05:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 18:05:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-12-07 18:05:49,998 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-12-07 18:05:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:49,998 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-12-07 18:05:49,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-12-07 18:05:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 18:05:49,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:49,999 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 18:05:49,999 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:49,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1031702656, now seen corresponding path program 1 times [2019-12-07 18:05:50,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:50,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333925373] [2019-12-07 18:05:50,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:50,030 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 18:05:50,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333925373] [2019-12-07 18:05:50,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:50,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:50,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972995873] [2019-12-07 18:05:50,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:50,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:50,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:50,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:50,031 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-12-07 18:05:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:50,261 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-12-07 18:05:50,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:50,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 18:05:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:50,262 INFO L225 Difference]: With dead ends: 324 [2019-12-07 18:05:50,262 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 18:05:50,263 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 18:05:50,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 18:05:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-12-07 18:05:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 18:05:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-12-07 18:05:50,266 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-12-07 18:05:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:50,267 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-12-07 18:05:50,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-12-07 18:05:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 18:05:50,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:50,267 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 18:05:50,267 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:50,268 INFO L82 PathProgramCache]: Analyzing trace with hash -538440438, now seen corresponding path program 1 times [2019-12-07 18:05:50,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:50,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669190994] [2019-12-07 18:05:50,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:50,294 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 18:05:50,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669190994] [2019-12-07 18:05:50,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:50,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:50,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176588104] [2019-12-07 18:05:50,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:50,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:50,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:50,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:50,295 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-12-07 18:05:50,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:50,501 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-12-07 18:05:50,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:50,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-07 18:05:50,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:50,503 INFO L225 Difference]: With dead ends: 324 [2019-12-07 18:05:50,503 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 18:05:50,503 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 18:05:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 18:05:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-12-07 18:05:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 18:05:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-12-07 18:05:50,507 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-12-07 18:05:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:50,507 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-12-07 18:05:50,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-12-07 18:05:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 18:05:50,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:50,508 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 18:05:50,508 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:50,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:50,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2007032891, now seen corresponding path program 1 times [2019-12-07 18:05:50,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:50,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238774416] [2019-12-07 18:05:50,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:50,544 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 18:05:50,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238774416] [2019-12-07 18:05:50,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:50,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:50,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682873560] [2019-12-07 18:05:50,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:50,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:50,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:50,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:50,546 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-12-07 18:05:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:50,716 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-12-07 18:05:50,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:50,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-07 18:05:50,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:50,717 INFO L225 Difference]: With dead ends: 314 [2019-12-07 18:05:50,717 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 18:05:50,717 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 18:05:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 18:05:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-12-07 18:05:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 18:05:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-12-07 18:05:50,720 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-12-07 18:05:50,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:50,720 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-12-07 18:05:50,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-12-07 18:05:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 18:05:50,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:50,721 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 18:05:50,721 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:50,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:50,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1409260885, now seen corresponding path program 1 times [2019-12-07 18:05:50,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:50,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362790625] [2019-12-07 18:05:50,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:50,771 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 18:05:50,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362790625] [2019-12-07 18:05:50,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:50,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:50,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025384273] [2019-12-07 18:05:50,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:50,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:50,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:50,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:50,773 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-12-07 18:05:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:51,061 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2019-12-07 18:05:51,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:51,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 18:05:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:51,063 INFO L225 Difference]: With dead ends: 403 [2019-12-07 18:05:51,063 INFO L226 Difference]: Without dead ends: 259 [2019-12-07 18:05:51,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:05:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-12-07 18:05:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2019-12-07 18:05:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-07 18:05:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-12-07 18:05:51,068 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-12-07 18:05:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:51,069 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-12-07 18:05:51,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-12-07 18:05:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 18:05:51,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:51,070 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 18:05:51,070 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:51,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:51,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1988313133, now seen corresponding path program 1 times [2019-12-07 18:05:51,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:51,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660684550] [2019-12-07 18:05:51,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:51,113 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 18:05:51,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660684550] [2019-12-07 18:05:51,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:51,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:51,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624064566] [2019-12-07 18:05:51,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:51,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:51,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:51,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:51,115 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-12-07 18:05:51,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:51,355 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-12-07 18:05:51,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:51,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 18:05:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:51,357 INFO L225 Difference]: With dead ends: 442 [2019-12-07 18:05:51,357 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 18:05:51,357 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 18:05:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 18:05:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-12-07 18:05:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 18:05:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-12-07 18:05:51,361 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-12-07 18:05:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:51,361 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-12-07 18:05:51,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-12-07 18:05:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 18:05:51,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:51,362 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 18:05:51,362 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:51,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:51,362 INFO L82 PathProgramCache]: Analyzing trace with hash -40403587, now seen corresponding path program 1 times [2019-12-07 18:05:51,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:51,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673089865] [2019-12-07 18:05:51,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:51,398 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 18:05:51,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673089865] [2019-12-07 18:05:51,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:51,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:51,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483283318] [2019-12-07 18:05:51,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:51,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:51,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:51,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:51,399 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-12-07 18:05:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:51,681 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2019-12-07 18:05:51,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:51,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 18:05:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:51,683 INFO L225 Difference]: With dead ends: 494 [2019-12-07 18:05:51,683 INFO L226 Difference]: Without dead ends: 283 [2019-12-07 18:05:51,683 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 18:05:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-07 18:05:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2019-12-07 18:05:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 18:05:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-12-07 18:05:51,687 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-12-07 18:05:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:51,687 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-12-07 18:05:51,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-12-07 18:05:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 18:05:51,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:51,688 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 18:05:51,688 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:51,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:51,688 INFO L82 PathProgramCache]: Analyzing trace with hash 271163, now seen corresponding path program 1 times [2019-12-07 18:05:51,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:51,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666781021] [2019-12-07 18:05:51,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:51,724 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 18:05:51,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666781021] [2019-12-07 18:05:51,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:51,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:51,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817798508] [2019-12-07 18:05:51,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:51,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:51,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:51,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:51,725 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-12-07 18:05:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:51,950 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2019-12-07 18:05:51,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:51,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 18:05:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:51,952 INFO L225 Difference]: With dead ends: 466 [2019-12-07 18:05:51,952 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 18:05:51,953 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 18:05:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 18:05:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-12-07 18:05:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 18:05:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-12-07 18:05:51,957 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-12-07 18:05:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:51,958 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-12-07 18:05:51,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-12-07 18:05:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 18:05:51,958 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:51,959 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 18:05:51,959 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1588160075, now seen corresponding path program 1 times [2019-12-07 18:05:51,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:51,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168254865] [2019-12-07 18:05:51,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:51,999 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 18:05:51,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168254865] [2019-12-07 18:05:51,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:52,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:52,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556180778] [2019-12-07 18:05:52,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:52,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:52,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:52,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:52,000 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-12-07 18:05:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:52,262 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2019-12-07 18:05:52,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:52,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 18:05:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:52,263 INFO L225 Difference]: With dead ends: 493 [2019-12-07 18:05:52,263 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 18:05:52,263 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 18:05:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 18:05:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-12-07 18:05:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 18:05:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-12-07 18:05:52,267 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-12-07 18:05:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:52,267 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-12-07 18:05:52,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-12-07 18:05:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 18:05:52,268 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:52,268 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 18:05:52,268 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:52,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1363613770, now seen corresponding path program 1 times [2019-12-07 18:05:52,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:52,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968827103] [2019-12-07 18:05:52,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:52,301 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 18:05:52,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968827103] [2019-12-07 18:05:52,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:52,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:52,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527228170] [2019-12-07 18:05:52,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:52,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:52,303 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-12-07 18:05:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:52,556 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2019-12-07 18:05:52,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:52,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 18:05:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:52,557 INFO L225 Difference]: With dead ends: 491 [2019-12-07 18:05:52,557 INFO L226 Difference]: Without dead ends: 280 [2019-12-07 18:05:52,558 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 18:05:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-07 18:05:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2019-12-07 18:05:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 18:05:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-12-07 18:05:52,562 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-12-07 18:05:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:52,562 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-12-07 18:05:52,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-12-07 18:05:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 18:05:52,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:52,563 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 18:05:52,563 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:52,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:52,563 INFO L82 PathProgramCache]: Analyzing trace with hash -414265610, now seen corresponding path program 1 times [2019-12-07 18:05:52,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:52,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773116087] [2019-12-07 18:05:52,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:52,597 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 18:05:52,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773116087] [2019-12-07 18:05:52,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:52,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:52,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831506892] [2019-12-07 18:05:52,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:52,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:52,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:52,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:52,598 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-12-07 18:05:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:53,064 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2019-12-07 18:05:53,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:53,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 18:05:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:53,068 INFO L225 Difference]: With dead ends: 490 [2019-12-07 18:05:53,068 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 18:05:53,069 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 18:05:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 18:05:53,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-12-07 18:05:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 18:05:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-12-07 18:05:53,079 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-12-07 18:05:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:53,080 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-12-07 18:05:53,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-12-07 18:05:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 18:05:53,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:53,082 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 18:05:53,083 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1868796449, now seen corresponding path program 1 times [2019-12-07 18:05:53,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:53,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219551600] [2019-12-07 18:05:53,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:53,148 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 18:05:53,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219551600] [2019-12-07 18:05:53,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:53,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:05:53,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733919146] [2019-12-07 18:05:53,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:05:53,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:53,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:05:53,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:05:53,150 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-12-07 18:05:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:53,788 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-12-07 18:05:53,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:05:53,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-07 18:05:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:53,793 INFO L225 Difference]: With dead ends: 462 [2019-12-07 18:05:53,793 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 18:05:53,794 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 18:05:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 18:05:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-12-07 18:05:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:05:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-12-07 18:05:53,807 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-12-07 18:05:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:53,808 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-12-07 18:05:53,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:05:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-12-07 18:05:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 18:05:53,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:53,810 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 18:05:53,810 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:53,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:53,811 INFO L82 PathProgramCache]: Analyzing trace with hash -102696520, now seen corresponding path program 1 times [2019-12-07 18:05:53,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:53,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712246814] [2019-12-07 18:05:53,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:53,851 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 18:05:53,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712246814] [2019-12-07 18:05:53,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:53,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:53,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055707794] [2019-12-07 18:05:53,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:53,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:53,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:53,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:53,852 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-12-07 18:05:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:54,066 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2019-12-07 18:05:54,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:54,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 18:05:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:54,068 INFO L225 Difference]: With dead ends: 503 [2019-12-07 18:05:54,068 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 18:05:54,068 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 18:05:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 18:05:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-12-07 18:05:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:05:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-12-07 18:05:54,073 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-12-07 18:05:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:54,073 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-12-07 18:05:54,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-12-07 18:05:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 18:05:54,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:54,074 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 18:05:54,074 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:54,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:54,074 INFO L82 PathProgramCache]: Analyzing trace with hash 846651640, now seen corresponding path program 1 times [2019-12-07 18:05:54,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:54,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037443271] [2019-12-07 18:05:54,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:54,106 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 18:05:54,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037443271] [2019-12-07 18:05:54,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:54,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:54,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049084221] [2019-12-07 18:05:54,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:54,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:54,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:54,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:54,107 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-12-07 18:05:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:54,321 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2019-12-07 18:05:54,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:54,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 18:05:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:54,322 INFO L225 Difference]: With dead ends: 502 [2019-12-07 18:05:54,323 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 18:05:54,323 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 18:05:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 18:05:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-12-07 18:05:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:05:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-12-07 18:05:54,327 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-12-07 18:05:54,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:54,327 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-12-07 18:05:54,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-12-07 18:05:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 18:05:54,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:54,328 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 18:05:54,328 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:54,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:54,328 INFO L82 PathProgramCache]: Analyzing trace with hash 651492985, now seen corresponding path program 1 times [2019-12-07 18:05:54,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:54,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611661462] [2019-12-07 18:05:54,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:54,359 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 18:05:54,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611661462] [2019-12-07 18:05:54,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:54,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:54,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366129387] [2019-12-07 18:05:54,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:54,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:54,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:54,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:54,360 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-12-07 18:05:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:54,632 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2019-12-07 18:05:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:54,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 18:05:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:54,633 INFO L225 Difference]: With dead ends: 530 [2019-12-07 18:05:54,633 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 18:05:54,634 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 18:05:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 18:05:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-12-07 18:05:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:05:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-12-07 18:05:54,640 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-12-07 18:05:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:54,640 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-12-07 18:05:54,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-12-07 18:05:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 18:05:54,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:54,641 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 18:05:54,641 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:54,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1085222071, now seen corresponding path program 1 times [2019-12-07 18:05:54,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:54,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395753316] [2019-12-07 18:05:54,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:54,680 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 18:05:54,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395753316] [2019-12-07 18:05:54,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:54,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:54,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567268825] [2019-12-07 18:05:54,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:54,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:54,681 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-12-07 18:05:54,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:54,889 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2019-12-07 18:05:54,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:54,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 18:05:54,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:54,891 INFO L225 Difference]: With dead ends: 502 [2019-12-07 18:05:54,891 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 18:05:54,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:05:54,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 18:05:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-12-07 18:05:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:05:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-12-07 18:05:54,895 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-12-07 18:05:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:54,895 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-12-07 18:05:54,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-12-07 18:05:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 18:05:54,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:54,896 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 18:05:54,896 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash 199692210, now seen corresponding path program 1 times [2019-12-07 18:05:54,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:54,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861000252] [2019-12-07 18:05:54,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:54,928 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 18:05:54,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861000252] [2019-12-07 18:05:54,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:54,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:54,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211046645] [2019-12-07 18:05:54,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:54,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:54,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:54,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:54,929 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-12-07 18:05:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:55,189 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2019-12-07 18:05:55,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:55,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 18:05:55,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:55,190 INFO L225 Difference]: With dead ends: 530 [2019-12-07 18:05:55,190 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 18:05:55,191 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 18:05:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 18:05:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-12-07 18:05:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:05:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-12-07 18:05:55,195 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-12-07 18:05:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:55,195 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-12-07 18:05:55,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-12-07 18:05:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 18:05:55,196 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:55,196 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 18:05:55,196 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 760391988, now seen corresponding path program 1 times [2019-12-07 18:05:55,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:55,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514816982] [2019-12-07 18:05:55,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:55,228 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 18:05:55,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514816982] [2019-12-07 18:05:55,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:55,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:55,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096162190] [2019-12-07 18:05:55,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:55,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:55,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:55,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:55,229 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-12-07 18:05:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:55,440 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2019-12-07 18:05:55,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:55,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 18:05:55,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:55,442 INFO L225 Difference]: With dead ends: 502 [2019-12-07 18:05:55,442 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 18:05:55,442 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 18:05:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 18:05:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-12-07 18:05:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:05:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-12-07 18:05:55,446 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-12-07 18:05:55,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:55,447 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-12-07 18:05:55,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:55,447 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-12-07 18:05:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 18:05:55,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:55,447 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 18:05:55,447 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:55,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2123930572, now seen corresponding path program 1 times [2019-12-07 18:05:55,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:55,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945672487] [2019-12-07 18:05:55,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:55,479 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 18:05:55,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945672487] [2019-12-07 18:05:55,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:55,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:55,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422664314] [2019-12-07 18:05:55,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:55,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:55,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:55,480 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-12-07 18:05:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:55,756 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2019-12-07 18:05:55,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:55,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 18:05:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:55,758 INFO L225 Difference]: With dead ends: 530 [2019-12-07 18:05:55,758 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 18:05:55,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 18:05:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 18:05:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-12-07 18:05:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:05:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-12-07 18:05:55,764 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-12-07 18:05:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:55,764 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-12-07 18:05:55,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-12-07 18:05:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 18:05:55,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:55,765 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 18:05:55,765 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:55,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1922106638, now seen corresponding path program 1 times [2019-12-07 18:05:55,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:55,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546302720] [2019-12-07 18:05:55,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:55,801 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 18:05:55,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546302720] [2019-12-07 18:05:55,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:55,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:55,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58055875] [2019-12-07 18:05:55,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:55,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:55,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:55,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:55,802 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-12-07 18:05:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:56,012 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2019-12-07 18:05:56,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:56,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 18:05:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:56,013 INFO L225 Difference]: With dead ends: 502 [2019-12-07 18:05:56,013 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 18:05:56,014 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 18:05:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 18:05:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-12-07 18:05:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:05:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-12-07 18:05:56,018 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-12-07 18:05:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:56,018 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-12-07 18:05:56,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-12-07 18:05:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 18:05:56,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:56,019 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 18:05:56,019 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:56,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:56,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1950473869, now seen corresponding path program 1 times [2019-12-07 18:05:56,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:56,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560781783] [2019-12-07 18:05:56,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:56,049 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 18:05:56,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560781783] [2019-12-07 18:05:56,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:56,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:56,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204209750] [2019-12-07 18:05:56,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:56,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:56,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:56,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:56,050 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-12-07 18:05:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:56,300 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2019-12-07 18:05:56,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:56,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 18:05:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:56,301 INFO L225 Difference]: With dead ends: 520 [2019-12-07 18:05:56,301 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 18:05:56,302 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 18:05:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 18:05:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-12-07 18:05:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:05:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-12-07 18:05:56,306 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-12-07 18:05:56,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:56,306 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-12-07 18:05:56,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-12-07 18:05:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 18:05:56,307 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:56,307 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 18:05:56,307 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:56,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:56,307 INFO L82 PathProgramCache]: Analyzing trace with hash -382918769, now seen corresponding path program 1 times [2019-12-07 18:05:56,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:56,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112596179] [2019-12-07 18:05:56,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:56,341 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 18:05:56,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112596179] [2019-12-07 18:05:56,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:56,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:56,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859063155] [2019-12-07 18:05:56,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:56,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:56,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:56,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:56,342 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-12-07 18:05:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:56,544 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2019-12-07 18:05:56,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:56,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 18:05:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:56,545 INFO L225 Difference]: With dead ends: 492 [2019-12-07 18:05:56,545 INFO L226 Difference]: Without dead ends: 261 [2019-12-07 18:05:56,546 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 18:05:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-07 18:05:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2019-12-07 18:05:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:05:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-12-07 18:05:56,550 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-12-07 18:05:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:56,550 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-12-07 18:05:56,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-12-07 18:05:56,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 18:05:56,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:56,551 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 18:05:56,551 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:56,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2022470311, now seen corresponding path program 1 times [2019-12-07 18:05:56,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:56,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097190793] [2019-12-07 18:05:56,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:56,585 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 18:05:56,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097190793] [2019-12-07 18:05:56,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:56,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:56,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961629312] [2019-12-07 18:05:56,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:56,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:56,586 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-12-07 18:05:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:56,832 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2019-12-07 18:05:56,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:56,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-12-07 18:05:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:56,833 INFO L225 Difference]: With dead ends: 520 [2019-12-07 18:05:56,833 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 18:05:56,834 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 18:05:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 18:05:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-12-07 18:05:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:05:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-12-07 18:05:56,839 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-12-07 18:05:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:56,840 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-12-07 18:05:56,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-12-07 18:05:56,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 18:05:56,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:56,841 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 18:05:56,841 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:56,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:56,841 INFO L82 PathProgramCache]: Analyzing trace with hash 586317147, now seen corresponding path program 1 times [2019-12-07 18:05:56,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:56,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969729052] [2019-12-07 18:05:56,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:56,884 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 18:05:56,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969729052] [2019-12-07 18:05:56,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:56,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:05:56,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614591257] [2019-12-07 18:05:56,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:05:56,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:05:56,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:05:56,885 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-12-07 18:05:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:56,911 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-12-07 18:05:56,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:05:56,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-12-07 18:05:56,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:56,914 INFO L225 Difference]: With dead ends: 710 [2019-12-07 18:05:56,914 INFO L226 Difference]: Without dead ends: 479 [2019-12-07 18:05:56,915 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 18:05:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-12-07 18:05:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-12-07 18:05:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-12-07 18:05:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-12-07 18:05:56,928 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-12-07 18:05:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:56,928 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-12-07 18:05:56,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:05:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-12-07 18:05:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 18:05:56,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:56,929 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 18:05:56,929 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:56,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:56,929 INFO L82 PathProgramCache]: Analyzing trace with hash -536013004, now seen corresponding path program 1 times [2019-12-07 18:05:56,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:56,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877273201] [2019-12-07 18:05:56,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:05:57,127 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:05:57,127 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:05:57,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:05:57 BoogieIcfgContainer [2019-12-07 18:05:57,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:05:57,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:05:57,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:05:57,225 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:05:57,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:05:45" (3/4) ... [2019-12-07 18:05:57,228 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:05:57,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:05:57,230 INFO L168 Benchmark]: Toolchain (without parser) took 12785.73 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 939.2 MB in the beginning and 823.9 MB in the end (delta: 115.4 MB). Peak memory consumption was 439.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:57,230 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:05:57,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:57,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.75 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:57,231 INFO L168 Benchmark]: Boogie Preprocessor took 52.80 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:57,232 INFO L168 Benchmark]: RCFGBuilder took 642.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 962.0 MB in the end (delta: 98.9 MB). Peak memory consumption was 98.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:57,232 INFO L168 Benchmark]: TraceAbstraction took 11593.71 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 224.4 MB). Free memory was 962.0 MB in the beginning and 823.9 MB in the end (delta: 138.2 MB). Peak memory consumption was 362.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:57,232 INFO L168 Benchmark]: Witness Printer took 3.60 ms. Allocated memory is still 1.4 GB. Free memory is still 823.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:05:57,234 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 438.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.75 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.80 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 642.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 962.0 MB in the end (delta: 98.9 MB). Peak memory consumption was 98.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11593.71 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 224.4 MB). Free memory was 962.0 MB in the beginning and 823.9 MB in the end (delta: 138.2 MB). Peak memory consumption was 362.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.60 ms. Allocated memory is still 1.4 GB. Free memory is still 823.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1703]: 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}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] 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}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={9:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={9:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] 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 [L1555] EXPR s->session [L1555] EXPR s->s3 [L1555] EXPR (s->s3)->tmp.new_cipher [L1555] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 3 VAL [init=1, SSLv3_server_data={9:0}] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1575] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={9:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] 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 [L1584] ret = __VERIFIER_nondet_int() [L1585] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={9:0}] [L1703] __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: 11.4s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7073 SDtfs, 2105 SDslu, 10601 SDs, 0 SdLazy, 6863 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s 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.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 924 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s 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 18:05:58,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:05:58,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:05:58,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:05:58,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:05:58,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:05:58,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:05:58,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:05:58,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:05:58,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:05:58,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:05:58,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:05:58,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:05:58,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:05:58,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:05:58,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:05:58,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:05:58,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:05:58,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:05:58,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:05:58,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:05:58,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:05:58,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:05:58,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:05:58,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:05:58,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:05:58,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:05:58,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:05:58,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:05:58,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:05:58,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:05:58,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:05:58,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:05:58,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:05:58,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:05:58,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:05:58,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:05:58,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:05:58,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:05:58,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:05:58,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:05:58,786 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 18:05:58,796 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:05:58,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:05:58,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:05:58,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:05:58,797 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:05:58,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:05:58,797 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:05:58,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:05:58,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:05:58,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:05:58,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:05:58,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:05:58,798 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 18:05:58,798 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 18:05:58,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:05:58,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:05:58,799 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:05:58,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:05:58,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:05:58,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:05:58,799 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:05:58,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:05:58,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:05:58,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:05:58,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:05:58,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:05:58,800 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 18:05:58,800 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 18:05:58,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:05:58,800 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:05:58,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 18:05:58,801 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_d7ee4b91-1d91-46a9-982d-9dd9c4403585/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 -> 09d651c8899349531493fefbd169797d0022b4a3 [2019-12-07 18:05:58,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:05:58,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:05:58,975 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:05:58,976 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:05:58,976 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:05:58,977 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-12-07 18:05:59,023 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/data/cb9d07c29/3a144d6b546046d78fdeae1dbd6117af/FLAGcc3c39754 [2019-12-07 18:05:59,470 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:05:59,471 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-12-07 18:05:59,483 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/data/cb9d07c29/3a144d6b546046d78fdeae1dbd6117af/FLAGcc3c39754 [2019-12-07 18:05:59,809 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/data/cb9d07c29/3a144d6b546046d78fdeae1dbd6117af [2019-12-07 18:05:59,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:05:59,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:05:59,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:05:59,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:05:59,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:05:59,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:05:59" (1/1) ... [2019-12-07 18:05:59,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411fde5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:59, skipping insertion in model container [2019-12-07 18:05:59,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:05:59" (1/1) ... [2019-12-07 18:05:59,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:05:59,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:06:00,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:06:00,162 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:06:00,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:06:00,271 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:06:00,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:06:00 WrapperNode [2019-12-07 18:06:00,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:06:00,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:06:00,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:06:00,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:06:00,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:06:00" (1/1) ... [2019-12-07 18:06:00,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:06:00" (1/1) ... [2019-12-07 18:06:00,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:06:00,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:06:00,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:06:00,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:06:00,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:06:00" (1/1) ... [2019-12-07 18:06:00,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:06:00" (1/1) ... [2019-12-07 18:06:00,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:06:00" (1/1) ... [2019-12-07 18:06:00,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:06:00" (1/1) ... [2019-12-07 18:06:00,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:06:00" (1/1) ... [2019-12-07 18:06:00,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:06:00" (1/1) ... [2019-12-07 18:06:00,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:06:00" (1/1) ... [2019-12-07 18:06:00,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:06:00,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:06:00,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:06:00,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:06:00,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:06:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/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 18:06:00,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:06:00,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:06:00,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 18:06:00,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:06:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:06:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:06:00,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:06:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 18:06:00,577 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:06:02,822 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 18:06:02,822 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 18:06:02,823 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:06:02,823 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:06:02,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:06:02 BoogieIcfgContainer [2019-12-07 18:06:02,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:06:02,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:06:02,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:06:02,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:06:02,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:05:59" (1/3) ... [2019-12-07 18:06:02,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed4258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:06:02, skipping insertion in model container [2019-12-07 18:06:02,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:06:00" (2/3) ... [2019-12-07 18:06:02,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed4258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:06:02, skipping insertion in model container [2019-12-07 18:06:02,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:06:02" (3/3) ... [2019-12-07 18:06:02,829 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2019-12-07 18:06:02,836 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:06:02,841 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:06:02,849 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:06:02,866 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:06:02,866 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:06:02,866 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:06:02,866 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:06:02,866 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:06:02,866 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:06:02,867 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:06:02,867 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:06:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-12-07 18:06:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:06:02,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:02,887 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 18:06:02,887 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:02,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:02,891 INFO L82 PathProgramCache]: Analyzing trace with hash 522837677, now seen corresponding path program 1 times [2019-12-07 18:06:02,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:06:02,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908972588] [2019-12-07 18:06:02,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/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 18:06:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:03,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:06:03,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:06:03,061 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 18:06:03,061 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:06:03,080 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 18:06:03,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908972588] [2019-12-07 18:06:03,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:03,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:06:03,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953392669] [2019-12-07 18:06:03,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:06:03,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:06:03,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:06:03,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:06:03,098 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-12-07 18:06:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:03,182 INFO L93 Difference]: Finished difference Result 537 states and 912 transitions. [2019-12-07 18:06:03,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:06:03,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 18:06:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:03,195 INFO L225 Difference]: With dead ends: 537 [2019-12-07 18:06:03,195 INFO L226 Difference]: Without dead ends: 363 [2019-12-07 18:06:03,197 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 18:06:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-07 18:06:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2019-12-07 18:06:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-07 18:06:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 551 transitions. [2019-12-07 18:06:03,243 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 551 transitions. Word has length 45 [2019-12-07 18:06:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:03,244 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 551 transitions. [2019-12-07 18:06:03,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:06:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2019-12-07 18:06:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 18:06:03,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:03,249 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 18:06:03,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 18:06:03,451 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:03,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash 856140206, now seen corresponding path program 1 times [2019-12-07 18:06:03,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:06:03,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137140604] [2019-12-07 18:06:03,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/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 18:06:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:03,745 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:06:03,749 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:06:03,773 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 18:06:03,773 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:06:03,797 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 18:06:03,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137140604] [2019-12-07 18:06:03,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:03,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:06:03,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498491795] [2019-12-07 18:06:03,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:06:03,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:06:03,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:06:03,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:06:03,801 INFO L87 Difference]: Start difference. First operand 363 states and 551 transitions. Second operand 4 states. [2019-12-07 18:06:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:04,015 INFO L93 Difference]: Finished difference Result 834 states and 1272 transitions. [2019-12-07 18:06:04,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:06:04,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-07 18:06:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:04,019 INFO L225 Difference]: With dead ends: 834 [2019-12-07 18:06:04,019 INFO L226 Difference]: Without dead ends: 598 [2019-12-07 18:06:04,021 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 18:06:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-12-07 18:06:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-12-07 18:06:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-12-07 18:06:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 906 transitions. [2019-12-07 18:06:04,052 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 906 transitions. Word has length 103 [2019-12-07 18:06:04,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:04,052 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 906 transitions. [2019-12-07 18:06:04,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:06:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 906 transitions. [2019-12-07 18:06:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 18:06:04,055 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:04,055 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 18:06:04,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 18:06:04,257 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:04,258 INFO L82 PathProgramCache]: Analyzing trace with hash -536013004, now seen corresponding path program 1 times [2019-12-07 18:06:04,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:06:04,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235844449] [2019-12-07 18:06:04,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/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 18:06:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:06:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:06:05,080 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 18:06:05,080 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:06:05,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 18:06:05,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:06:05 BoogieIcfgContainer [2019-12-07 18:06:05,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:06:05,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:06:05,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:06:05,470 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:06:05,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:06:02" (3/4) ... [2019-12-07 18:06:05,471 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:06:05,551 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d7ee4b91-1d91-46a9-982d-9dd9c4403585/bin/uautomizer/witness.graphml [2019-12-07 18:06:05,552 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:06:05,553 INFO L168 Benchmark]: Toolchain (without parser) took 5740.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:06:05,553 INFO L168 Benchmark]: CDTParser took 0.18 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 18:06:05,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:06:05,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.15 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 18:06:05,554 INFO L168 Benchmark]: Boogie Preprocessor took 69.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:06:05,554 INFO L168 Benchmark]: RCFGBuilder took 2415.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.1 MB in the end (delta: 99.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:06:05,555 INFO L168 Benchmark]: TraceAbstraction took 2644.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 980.1 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:06:05,555 INFO L168 Benchmark]: Witness Printer took 82.20 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.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:06:05,556 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.18 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 459.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.15 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 69.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2415.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.1 MB in the end (delta: 99.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2644.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 980.1 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 82.20 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.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1703]: 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}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] 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}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={15:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={15:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] 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 [L1555] EXPR s->session [L1555] EXPR s->s3 [L1555] EXPR (s->s3)->tmp.new_cipher [L1555] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 3 VAL [init=1, SSLv3_server_data={15:0}] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1575] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={15:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] 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 [L1584] ret = __VERIFIER_nondet_int() [L1585] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={15:0}] [L1703] __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.4s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 588 SDtfs, 658 SDslu, 785 SDs, 0 SdLazy, 51 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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=598occurred 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.1s 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...