./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_14.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_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/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 f0194e72737fa00e9def2494335d4249cbea0bcd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:27:08,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:27:08,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:27:08,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:27:08,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:27:08,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:27:08,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:27:08,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:27:08,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:27:08,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:27:08,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:27:08,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:27:08,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:27:08,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:27:08,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:27:08,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:27:08,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:27:08,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:27:08,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:27:08,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:27:08,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:27:08,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:27:08,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:27:08,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:27:08,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:27:08,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:27:08,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:27:08,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:27:08,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:27:08,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:27:08,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:27:08,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:27:08,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:27:08,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:27:08,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:27:08,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:27:08,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:27:08,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:27:08,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:27:08,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:27:08,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:27:08,804 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:27:08,813 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:27:08,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:27:08,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:27:08,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:27:08,814 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:27:08,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:27:08,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:27:08,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:27:08,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:27:08,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:27:08,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:27:08,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:27:08,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:27:08,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:27:08,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:27:08,815 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:27:08,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:27:08,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:27:08,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:27:08,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:27:08,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:27:08,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:27:08,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:27:08,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:27:08,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:27:08,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:27:08,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:27:08,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:27:08,817 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:27:08,817 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_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/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 -> f0194e72737fa00e9def2494335d4249cbea0bcd [2019-12-07 11:27:08,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:27:08,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:27:08,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:27:08,929 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:27:08,929 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:27:08,930 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c [2019-12-07 11:27:08,968 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/bin/uautomizer/data/e7d2398a3/c3b709fb1b0146bcb4c4823cd656022d/FLAGbe0db6975 [2019-12-07 11:27:09,481 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:27:09,481 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c [2019-12-07 11:27:09,492 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/bin/uautomizer/data/e7d2398a3/c3b709fb1b0146bcb4c4823cd656022d/FLAGbe0db6975 [2019-12-07 11:27:09,956 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/bin/uautomizer/data/e7d2398a3/c3b709fb1b0146bcb4c4823cd656022d [2019-12-07 11:27:09,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:27:09,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:27:09,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:27:09,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:27:09,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:27:09,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:27:09" (1/1) ... [2019-12-07 11:27:09,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e378e73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:09, skipping insertion in model container [2019-12-07 11:27:09,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:27:09" (1/1) ... [2019-12-07 11:27:09,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:27:10,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:27:10,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:27:10,194 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:27:10,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:27:10,240 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:27:10,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:10 WrapperNode [2019-12-07 11:27:10,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:27:10,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:27:10,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:27:10,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:27:10,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:10" (1/1) ... [2019-12-07 11:27:10,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:10" (1/1) ... [2019-12-07 11:27:10,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:27:10,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:27:10,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:27:10,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:27:10,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:10" (1/1) ... [2019-12-07 11:27:10,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:10" (1/1) ... [2019-12-07 11:27:10,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:10" (1/1) ... [2019-12-07 11:27:10,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:10" (1/1) ... [2019-12-07 11:27:10,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:10" (1/1) ... [2019-12-07 11:27:10,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:10" (1/1) ... [2019-12-07 11:27:10,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:10" (1/1) ... [2019-12-07 11:27:10,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:27:10,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:27:10,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:27:10,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:27:10,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:27:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:27:10,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:27:10,414 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:27:10,720 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 11:27:10,720 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 11:27:10,721 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:27:10,721 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:27:10,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:27:10 BoogieIcfgContainer [2019-12-07 11:27:10,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:27:10,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:27:10,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:27:10,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:27:10,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:27:09" (1/3) ... [2019-12-07 11:27:10,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e392cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:27:10, skipping insertion in model container [2019-12-07 11:27:10,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:10" (2/3) ... [2019-12-07 11:27:10,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e392cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:27:10, skipping insertion in model container [2019-12-07 11:27:10,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:27:10" (3/3) ... [2019-12-07 11:27:10,726 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2019-12-07 11:27:10,732 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:27:10,737 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:27:10,744 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:27:10,759 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:27:10,759 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:27:10,759 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:27:10,760 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:27:10,760 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:27:10,760 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:27:10,760 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:27:10,760 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:27:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-12-07 11:27:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:27:10,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:10,777 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] [2019-12-07 11:27:10,777 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:10,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:10,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1734880928, now seen corresponding path program 1 times [2019-12-07 11:27:10,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:10,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928676591] [2019-12-07 11:27:10,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:10,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928676591] [2019-12-07 11:27:10,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:10,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:27:10,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727408507] [2019-12-07 11:27:10,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:10,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:10,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:10,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:10,927 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2019-12-07 11:27:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:11,055 INFO L93 Difference]: Finished difference Result 323 states and 555 transitions. [2019-12-07 11:27:11,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:11,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 11:27:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:11,066 INFO L225 Difference]: With dead ends: 323 [2019-12-07 11:27:11,066 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 11:27:11,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 11:27:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2019-12-07 11:27:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 11:27:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2019-12-07 11:27:11,107 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 22 [2019-12-07 11:27:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:11,108 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2019-12-07 11:27:11,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2019-12-07 11:27:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 11:27:11,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:11,109 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] [2019-12-07 11:27:11,110 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:11,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:11,110 INFO L82 PathProgramCache]: Analyzing trace with hash -923936279, now seen corresponding path program 1 times [2019-12-07 11:27:11,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:11,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562367135] [2019-12-07 11:27:11,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:11,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562367135] [2019-12-07 11:27:11,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:11,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:27:11,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668795414] [2019-12-07 11:27:11,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:11,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:11,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:11,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,157 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand 3 states. [2019-12-07 11:27:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:11,234 INFO L93 Difference]: Finished difference Result 330 states and 522 transitions. [2019-12-07 11:27:11,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:11,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 11:27:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:11,236 INFO L225 Difference]: With dead ends: 330 [2019-12-07 11:27:11,236 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 11:27:11,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 11:27:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-12-07 11:27:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 11:27:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 281 transitions. [2019-12-07 11:27:11,247 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 281 transitions. Word has length 23 [2019-12-07 11:27:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:11,248 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 281 transitions. [2019-12-07 11:27:11,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 281 transitions. [2019-12-07 11:27:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 11:27:11,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:11,249 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] [2019-12-07 11:27:11,249 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:11,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:11,249 INFO L82 PathProgramCache]: Analyzing trace with hash -936892908, now seen corresponding path program 1 times [2019-12-07 11:27:11,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:11,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165922432] [2019-12-07 11:27:11,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:11,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165922432] [2019-12-07 11:27:11,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:11,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:27:11,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607564022] [2019-12-07 11:27:11,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:11,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:11,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:11,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,280 INFO L87 Difference]: Start difference. First operand 179 states and 281 transitions. Second operand 3 states. [2019-12-07 11:27:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:11,368 INFO L93 Difference]: Finished difference Result 361 states and 566 transitions. [2019-12-07 11:27:11,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:11,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 11:27:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:11,370 INFO L225 Difference]: With dead ends: 361 [2019-12-07 11:27:11,371 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 11:27:11,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 11:27:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2019-12-07 11:27:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-12-07 11:27:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 292 transitions. [2019-12-07 11:27:11,386 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 292 transitions. Word has length 23 [2019-12-07 11:27:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:11,386 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 292 transitions. [2019-12-07 11:27:11,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 292 transitions. [2019-12-07 11:27:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 11:27:11,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:11,388 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] [2019-12-07 11:27:11,388 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1640243884, now seen corresponding path program 1 times [2019-12-07 11:27:11,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:11,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523674410] [2019-12-07 11:27:11,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:11,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523674410] [2019-12-07 11:27:11,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:11,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:27:11,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089236910] [2019-12-07 11:27:11,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:11,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:11,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:11,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,425 INFO L87 Difference]: Start difference. First operand 185 states and 292 transitions. Second operand 3 states. [2019-12-07 11:27:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:11,516 INFO L93 Difference]: Finished difference Result 366 states and 576 transitions. [2019-12-07 11:27:11,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:11,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 11:27:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:11,517 INFO L225 Difference]: With dead ends: 366 [2019-12-07 11:27:11,518 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 11:27:11,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 11:27:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-12-07 11:27:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 11:27:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2019-12-07 11:27:11,526 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 23 [2019-12-07 11:27:11,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:11,526 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2019-12-07 11:27:11,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2019-12-07 11:27:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:27:11,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:11,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:27:11,527 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:11,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:11,528 INFO L82 PathProgramCache]: Analyzing trace with hash 940477948, now seen corresponding path program 1 times [2019-12-07 11:27:11,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:11,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613014368] [2019-12-07 11:27:11,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:11,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613014368] [2019-12-07 11:27:11,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:11,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:27:11,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31622671] [2019-12-07 11:27:11,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:11,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:11,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:11,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,552 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand 3 states. [2019-12-07 11:27:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:11,630 INFO L93 Difference]: Finished difference Result 377 states and 588 transitions. [2019-12-07 11:27:11,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:11,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 11:27:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:11,632 INFO L225 Difference]: With dead ends: 377 [2019-12-07 11:27:11,632 INFO L226 Difference]: Without dead ends: 198 [2019-12-07 11:27:11,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-12-07 11:27:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-12-07 11:27:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 11:27:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2019-12-07 11:27:11,640 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 24 [2019-12-07 11:27:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:11,641 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2019-12-07 11:27:11,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2019-12-07 11:27:11,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:27:11,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:11,642 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] [2019-12-07 11:27:11,642 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:11,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:11,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1862867376, now seen corresponding path program 1 times [2019-12-07 11:27:11,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:11,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114468803] [2019-12-07 11:27:11,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:11,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114468803] [2019-12-07 11:27:11,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:11,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:27:11,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462805005] [2019-12-07 11:27:11,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:11,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:11,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:11,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,664 INFO L87 Difference]: Start difference. First operand 186 states and 291 transitions. Second operand 3 states. [2019-12-07 11:27:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:11,751 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2019-12-07 11:27:11,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:11,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 11:27:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:11,753 INFO L225 Difference]: With dead ends: 377 [2019-12-07 11:27:11,753 INFO L226 Difference]: Without dead ends: 198 [2019-12-07 11:27:11,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-12-07 11:27:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-12-07 11:27:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 11:27:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 289 transitions. [2019-12-07 11:27:11,759 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 289 transitions. Word has length 25 [2019-12-07 11:27:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:11,759 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 289 transitions. [2019-12-07 11:27:11,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2019-12-07 11:27:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:27:11,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:11,760 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] [2019-12-07 11:27:11,761 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:11,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:11,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2134464983, now seen corresponding path program 1 times [2019-12-07 11:27:11,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:11,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093732411] [2019-12-07 11:27:11,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:11,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093732411] [2019-12-07 11:27:11,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:11,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:27:11,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82743869] [2019-12-07 11:27:11,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:11,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:11,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:11,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,778 INFO L87 Difference]: Start difference. First operand 186 states and 289 transitions. Second operand 3 states. [2019-12-07 11:27:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:11,845 INFO L93 Difference]: Finished difference Result 377 states and 580 transitions. [2019-12-07 11:27:11,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:11,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 11:27:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:11,847 INFO L225 Difference]: With dead ends: 377 [2019-12-07 11:27:11,847 INFO L226 Difference]: Without dead ends: 198 [2019-12-07 11:27:11,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-12-07 11:27:11,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-12-07 11:27:11,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 11:27:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 287 transitions. [2019-12-07 11:27:11,852 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 287 transitions. Word has length 26 [2019-12-07 11:27:11,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:11,852 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 287 transitions. [2019-12-07 11:27:11,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 287 transitions. [2019-12-07 11:27:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:27:11,853 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:11,853 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] [2019-12-07 11:27:11,853 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:11,854 INFO L82 PathProgramCache]: Analyzing trace with hash 744248342, now seen corresponding path program 1 times [2019-12-07 11:27:11,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:11,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075986556] [2019-12-07 11:27:11,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:11,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075986556] [2019-12-07 11:27:11,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:11,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:27:11,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362400342] [2019-12-07 11:27:11,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:11,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:11,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:11,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,872 INFO L87 Difference]: Start difference. First operand 186 states and 287 transitions. Second operand 3 states. [2019-12-07 11:27:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:11,886 INFO L93 Difference]: Finished difference Result 536 states and 822 transitions. [2019-12-07 11:27:11,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:11,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 11:27:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:11,888 INFO L225 Difference]: With dead ends: 536 [2019-12-07 11:27:11,889 INFO L226 Difference]: Without dead ends: 357 [2019-12-07 11:27:11,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-07 11:27:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2019-12-07 11:27:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-12-07 11:27:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2019-12-07 11:27:11,902 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 26 [2019-12-07 11:27:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:11,902 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2019-12-07 11:27:11,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2019-12-07 11:27:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:27:11,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:11,903 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] [2019-12-07 11:27:11,903 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:11,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:11,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1232648243, now seen corresponding path program 1 times [2019-12-07 11:27:11,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:11,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911013781] [2019-12-07 11:27:11,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:11,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911013781] [2019-12-07 11:27:11,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:11,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:27:11,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971462071] [2019-12-07 11:27:11,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:27:11,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:11,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:27:11,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:27:11,933 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand 4 states. [2019-12-07 11:27:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:12,085 INFO L93 Difference]: Finished difference Result 1099 states and 1679 transitions. [2019-12-07 11:27:12,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:27:12,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 11:27:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:12,088 INFO L225 Difference]: With dead ends: 1099 [2019-12-07 11:27:12,088 INFO L226 Difference]: Without dead ends: 752 [2019-12-07 11:27:12,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:27:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-12-07 11:27:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 598. [2019-12-07 11:27:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-12-07 11:27:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 927 transitions. [2019-12-07 11:27:12,104 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 927 transitions. Word has length 27 [2019-12-07 11:27:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:12,105 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 927 transitions. [2019-12-07 11:27:12,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:27:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 927 transitions. [2019-12-07 11:27:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:27:12,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:12,106 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] [2019-12-07 11:27:12,106 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:12,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:12,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707043, now seen corresponding path program 1 times [2019-12-07 11:27:12,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:12,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599425411] [2019-12-07 11:27:12,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:12,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599425411] [2019-12-07 11:27:12,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:12,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:27:12,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476250493] [2019-12-07 11:27:12,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:12,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:12,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,127 INFO L87 Difference]: Start difference. First operand 598 states and 927 transitions. Second operand 3 states. [2019-12-07 11:27:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:12,230 INFO L93 Difference]: Finished difference Result 1330 states and 2091 transitions. [2019-12-07 11:27:12,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:12,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 11:27:12,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:12,234 INFO L225 Difference]: With dead ends: 1330 [2019-12-07 11:27:12,234 INFO L226 Difference]: Without dead ends: 740 [2019-12-07 11:27:12,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-12-07 11:27:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 720. [2019-12-07 11:27:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 11:27:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1142 transitions. [2019-12-07 11:27:12,253 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1142 transitions. Word has length 41 [2019-12-07 11:27:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:12,253 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1142 transitions. [2019-12-07 11:27:12,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1142 transitions. [2019-12-07 11:27:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:27:12,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:12,254 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] [2019-12-07 11:27:12,254 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:12,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716310, now seen corresponding path program 1 times [2019-12-07 11:27:12,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:12,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13565377] [2019-12-07 11:27:12,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:12,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13565377] [2019-12-07 11:27:12,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:12,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:27:12,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270689149] [2019-12-07 11:27:12,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:12,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:12,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:12,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,274 INFO L87 Difference]: Start difference. First operand 720 states and 1142 transitions. Second operand 3 states. [2019-12-07 11:27:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:12,383 INFO L93 Difference]: Finished difference Result 1497 states and 2391 transitions. [2019-12-07 11:27:12,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:12,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 11:27:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:12,386 INFO L225 Difference]: With dead ends: 1497 [2019-12-07 11:27:12,386 INFO L226 Difference]: Without dead ends: 785 [2019-12-07 11:27:12,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-12-07 11:27:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 765. [2019-12-07 11:27:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-12-07 11:27:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1227 transitions. [2019-12-07 11:27:12,407 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1227 transitions. Word has length 42 [2019-12-07 11:27:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:12,407 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1227 transitions. [2019-12-07 11:27:12,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1227 transitions. [2019-12-07 11:27:12,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 11:27:12,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:12,408 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:27:12,408 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:12,408 INFO L82 PathProgramCache]: Analyzing trace with hash 477806323, now seen corresponding path program 1 times [2019-12-07 11:27:12,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:12,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822406416] [2019-12-07 11:27:12,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:12,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822406416] [2019-12-07 11:27:12,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:12,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:27:12,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617674542] [2019-12-07 11:27:12,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:12,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:12,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:12,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,426 INFO L87 Difference]: Start difference. First operand 765 states and 1227 transitions. Second operand 3 states. [2019-12-07 11:27:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:12,442 INFO L93 Difference]: Finished difference Result 1522 states and 2442 transitions. [2019-12-07 11:27:12,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:12,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 11:27:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:12,446 INFO L225 Difference]: With dead ends: 1522 [2019-12-07 11:27:12,446 INFO L226 Difference]: Without dead ends: 765 [2019-12-07 11:27:12,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-12-07 11:27:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2019-12-07 11:27:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-12-07 11:27:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1210 transitions. [2019-12-07 11:27:12,465 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1210 transitions. Word has length 43 [2019-12-07 11:27:12,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:12,465 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1210 transitions. [2019-12-07 11:27:12,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1210 transitions. [2019-12-07 11:27:12,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 11:27:12,466 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:12,466 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:27:12,466 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:12,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:12,467 INFO L82 PathProgramCache]: Analyzing trace with hash -701855575, now seen corresponding path program 1 times [2019-12-07 11:27:12,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:12,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353871550] [2019-12-07 11:27:12,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:12,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353871550] [2019-12-07 11:27:12,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:12,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:27:12,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362974191] [2019-12-07 11:27:12,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:12,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:12,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:12,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,483 INFO L87 Difference]: Start difference. First operand 765 states and 1210 transitions. Second operand 3 states. [2019-12-07 11:27:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:12,516 INFO L93 Difference]: Finished difference Result 1536 states and 2425 transitions. [2019-12-07 11:27:12,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:12,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 11:27:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:12,520 INFO L225 Difference]: With dead ends: 1536 [2019-12-07 11:27:12,520 INFO L226 Difference]: Without dead ends: 779 [2019-12-07 11:27:12,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-12-07 11:27:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2019-12-07 11:27:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-12-07 11:27:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1208 transitions. [2019-12-07 11:27:12,540 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1208 transitions. Word has length 44 [2019-12-07 11:27:12,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:12,541 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1208 transitions. [2019-12-07 11:27:12,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1208 transitions. [2019-12-07 11:27:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 11:27:12,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:12,542 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:27:12,542 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:12,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash 616075766, now seen corresponding path program 1 times [2019-12-07 11:27:12,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:12,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343941995] [2019-12-07 11:27:12,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:12,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343941995] [2019-12-07 11:27:12,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:12,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:27:12,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796132803] [2019-12-07 11:27:12,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:12,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:12,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:12,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,559 INFO L87 Difference]: Start difference. First operand 777 states and 1208 transitions. Second operand 3 states. [2019-12-07 11:27:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:12,602 INFO L93 Difference]: Finished difference Result 2298 states and 3572 transitions. [2019-12-07 11:27:12,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:12,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-07 11:27:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:12,608 INFO L225 Difference]: With dead ends: 2298 [2019-12-07 11:27:12,608 INFO L226 Difference]: Without dead ends: 1529 [2019-12-07 11:27:12,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2019-12-07 11:27:12,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1217. [2019-12-07 11:27:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-07 11:27:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1884 transitions. [2019-12-07 11:27:12,642 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1884 transitions. Word has length 49 [2019-12-07 11:27:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:12,642 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1884 transitions. [2019-12-07 11:27:12,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1884 transitions. [2019-12-07 11:27:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 11:27:12,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:12,644 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:27:12,644 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:12,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1509562104, now seen corresponding path program 1 times [2019-12-07 11:27:12,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:12,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328175977] [2019-12-07 11:27:12,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:12,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328175977] [2019-12-07 11:27:12,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:12,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:27:12,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499209656] [2019-12-07 11:27:12,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:12,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:12,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:12,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,665 INFO L87 Difference]: Start difference. First operand 1217 states and 1884 transitions. Second operand 3 states. [2019-12-07 11:27:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:12,811 INFO L93 Difference]: Finished difference Result 2638 states and 4072 transitions. [2019-12-07 11:27:12,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:12,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-07 11:27:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:12,819 INFO L225 Difference]: With dead ends: 2638 [2019-12-07 11:27:12,819 INFO L226 Difference]: Without dead ends: 1430 [2019-12-07 11:27:12,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-12-07 11:27:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1324. [2019-12-07 11:27:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2019-12-07 11:27:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1999 transitions. [2019-12-07 11:27:12,872 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1999 transitions. Word has length 49 [2019-12-07 11:27:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:12,872 INFO L462 AbstractCegarLoop]: Abstraction has 1324 states and 1999 transitions. [2019-12-07 11:27:12,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1999 transitions. [2019-12-07 11:27:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 11:27:12,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:12,875 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:27:12,875 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:12,875 INFO L82 PathProgramCache]: Analyzing trace with hash 531471331, now seen corresponding path program 1 times [2019-12-07 11:27:12,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:12,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376851918] [2019-12-07 11:27:12,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 11:27:12,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376851918] [2019-12-07 11:27:12,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:12,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:27:12,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417357079] [2019-12-07 11:27:12,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:12,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:12,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:12,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,902 INFO L87 Difference]: Start difference. First operand 1324 states and 1999 transitions. Second operand 3 states. [2019-12-07 11:27:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:12,937 INFO L93 Difference]: Finished difference Result 2486 states and 3735 transitions. [2019-12-07 11:27:12,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:12,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 11:27:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:12,943 INFO L225 Difference]: With dead ends: 2486 [2019-12-07 11:27:12,944 INFO L226 Difference]: Without dead ends: 1659 [2019-12-07 11:27:12,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2019-12-07 11:27:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1185. [2019-12-07 11:27:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-07 11:27:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1780 transitions. [2019-12-07 11:27:12,979 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1780 transitions. Word has length 54 [2019-12-07 11:27:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:12,979 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1780 transitions. [2019-12-07 11:27:12,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1780 transitions. [2019-12-07 11:27:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:27:12,980 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:12,980 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:27:12,980 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:12,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:12,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1599732210, now seen corresponding path program 1 times [2019-12-07 11:27:12,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:12,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613233550] [2019-12-07 11:27:12,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:13,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613233550] [2019-12-07 11:27:13,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:13,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:27:13,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991200269] [2019-12-07 11:27:13,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:13,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:27:13,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:13,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:13,008 INFO L87 Difference]: Start difference. First operand 1185 states and 1780 transitions. Second operand 3 states. [2019-12-07 11:27:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:13,063 INFO L93 Difference]: Finished difference Result 3421 states and 5102 transitions. [2019-12-07 11:27:13,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:13,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 11:27:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:13,072 INFO L225 Difference]: With dead ends: 3421 [2019-12-07 11:27:13,072 INFO L226 Difference]: Without dead ends: 2245 [2019-12-07 11:27:13,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-12-07 11:27:13,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2243. [2019-12-07 11:27:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-12-07 11:27:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3304 transitions. [2019-12-07 11:27:13,134 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3304 transitions. Word has length 55 [2019-12-07 11:27:13,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:13,134 INFO L462 AbstractCegarLoop]: Abstraction has 2243 states and 3304 transitions. [2019-12-07 11:27:13,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3304 transitions. [2019-12-07 11:27:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:27:13,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:13,137 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:27:13,137 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:13,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1445576834, now seen corresponding path program 1 times [2019-12-07 11:27:13,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:27:13,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406237810] [2019-12-07 11:27:13,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:27:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:27:13,178 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:27:13,178 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:27:13,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:27:13 BoogieIcfgContainer [2019-12-07 11:27:13,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:27:13,216 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:27:13,216 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:27:13,216 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:27:13,217 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:27:10" (3/4) ... [2019-12-07 11:27:13,218 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:27:13,274 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0ec5e4d9-0b01-4175-8c5e-7d1effad6651/bin/uautomizer/witness.graphml [2019-12-07 11:27:13,274 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:27:13,276 INFO L168 Benchmark]: Toolchain (without parser) took 3316.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 939.3 MB in the beginning and 887.5 MB in the end (delta: 51.8 MB). Peak memory consumption was 232.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:27:13,277 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 957.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:27:13,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:27:13,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.54 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: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:27:13,278 INFO L168 Benchmark]: Boogie Preprocessor took 24.75 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: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:27:13,278 INFO L168 Benchmark]: RCFGBuilder took 418.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:27:13,278 INFO L168 Benchmark]: TraceAbstraction took 2493.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.0 GB in the beginning and 899.0 MB in the end (delta: 149.5 MB). Peak memory consumption was 208.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:27:13,279 INFO L168 Benchmark]: Witness Printer took 58.49 ms. Allocated memory is still 1.2 GB. Free memory was 899.0 MB in the beginning and 887.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:27:13,280 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 957.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.54 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: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.75 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: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 418.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2493.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.0 GB in the beginning and 899.0 MB in the end (delta: 149.5 MB). Peak memory consumption was 208.7 MB. Max. memory is 11.5 GB. * Witness Printer took 58.49 ms. Allocated memory is still 1.2 GB. Free memory was 899.0 MB in the beginning and 887.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 640]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L645] int s ; [L646] int tmp ; [L650] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L40] int s__session__cipher ; [L41] int buf ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L72] s__s3__tmp__reuse_message = 0 [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND FALSE !(state == 8496) [L614] COND FALSE !(\read(s__debug)) [L620] COND TRUE cb != 0 [L621] COND TRUE s__state != state [L622] new_state = s__state [L623] s__state = state [L624] s__state = new_state [L629] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 8512 [L297] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND TRUE state == 8496 [L640] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3434 SDtfs, 3298 SDslu, 1317 SDs, 0 SdLazy, 1077 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2243occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1140 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 652 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 70785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 102/102 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...