./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/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 a4ba7a359047c30b647e3fae146392c1b2eaa08f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-678e011 [2019-11-20 07:10:51,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:10:51,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:10:51,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:10:51,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:10:51,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:10:51,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:10:51,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:10:51,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:10:51,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:10:51,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:10:51,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:10:51,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:10:51,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:10:51,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:10:51,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:10:51,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:10:51,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:10:51,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:10:51,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:10:51,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:10:51,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:10:51,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:10:51,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:10:51,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:10:51,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:10:51,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:10:51,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:10:51,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:10:51,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:10:51,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:10:51,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:10:51,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:10:51,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:10:51,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:10:51,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:10:51,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:10:51,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:10:51,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:10:51,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:10:51,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:10:51,788 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 07:10:51,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:10:51,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:10:51,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:10:51,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:10:51,802 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:10:51,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:10:51,802 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:10:51,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:10:51,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:10:51,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:10:51,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:10:51,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:10:51,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:10:51,804 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:10:51,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:10:51,804 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:10:51,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:10:51,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:10:51,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:10:51,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:10:51,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:10:51,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:10:51,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:10:51,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:10:51,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:10:51,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:10:51,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 07:10:51,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:10:51,806 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_87dfa900-a7d2-4896-b0be-f30c66ef099c/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 -> a4ba7a359047c30b647e3fae146392c1b2eaa08f [2019-11-20 07:10:51,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:10:51,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:10:51,975 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:10:51,976 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:10:51,977 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:10:51,977 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-11-20 07:10:52,043 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/bin/uautomizer/data/c76d072e0/346291c3535248f183a33c601d6b26ac/FLAGedbc536d7 [2019-11-20 07:10:52,497 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:10:52,497 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-11-20 07:10:52,509 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/bin/uautomizer/data/c76d072e0/346291c3535248f183a33c601d6b26ac/FLAGedbc536d7 [2019-11-20 07:10:52,841 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/bin/uautomizer/data/c76d072e0/346291c3535248f183a33c601d6b26ac [2019-11-20 07:10:52,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:10:52,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:10:52,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:10:52,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:10:52,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:10:52,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:10:52" (1/1) ... [2019-11-20 07:10:52,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea93fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:52, skipping insertion in model container [2019-11-20 07:10:52,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:10:52" (1/1) ... [2019-11-20 07:10:52,857 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:10:52,895 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:10:53,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:10:53,222 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:10:53,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:10:53,322 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:10:53,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:53 WrapperNode [2019-11-20 07:10:53,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:10:53,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:10:53,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:10:53,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:10:53,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:53" (1/1) ... [2019-11-20 07:10:53,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:53" (1/1) ... [2019-11-20 07:10:53,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:10:53,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:10:53,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:10:53,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:10:53,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:53" (1/1) ... [2019-11-20 07:10:53,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:53" (1/1) ... [2019-11-20 07:10:53,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:53" (1/1) ... [2019-11-20 07:10:53,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:53" (1/1) ... [2019-11-20 07:10:53,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:53" (1/1) ... [2019-11-20 07:10:53,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:53" (1/1) ... [2019-11-20 07:10:53,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:53" (1/1) ... [2019-11-20 07:10:53,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:10:53,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:10:53,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:10:53,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:10:53,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:10:53,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:10:53,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:10:53,603 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 07:10:54,332 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 07:10:54,333 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 07:10:54,334 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:10:54,334 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 07:10:54,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:10:54 BoogieIcfgContainer [2019-11-20 07:10:54,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:10:54,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:10:54,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:10:54,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:10:54,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:10:52" (1/3) ... [2019-11-20 07:10:54,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c362dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:10:54, skipping insertion in model container [2019-11-20 07:10:54,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:53" (2/3) ... [2019-11-20 07:10:54,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c362dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:10:54, skipping insertion in model container [2019-11-20 07:10:54,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:10:54" (3/3) ... [2019-11-20 07:10:54,342 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.c [2019-11-20 07:10:54,350 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:10:54,356 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 07:10:54,366 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 07:10:54,389 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:10:54,389 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:10:54,390 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:10:54,390 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:10:54,390 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:10:54,390 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:10:54,390 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:10:54,390 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:10:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-20 07:10:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 07:10:54,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:54,414 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-11-20 07:10:54,414 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:54,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:54,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1440243157, now seen corresponding path program 1 times [2019-11-20 07:10:54,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:54,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394084032] [2019-11-20 07:10:54,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:54,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394084032] [2019-11-20 07:10:54,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:54,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:54,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317588095] [2019-11-20 07:10:54,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:54,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:54,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:54,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:54,618 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-20 07:10:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:54,909 INFO L93 Difference]: Finished difference Result 324 states and 556 transitions. [2019-11-20 07:10:54,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:54,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 07:10:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:54,935 INFO L225 Difference]: With dead ends: 324 [2019-11-20 07:10:54,935 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 07:10:54,941 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-11-20 07:10:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 07:10:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-11-20 07:10:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-20 07:10:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2019-11-20 07:10:55,037 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 25 [2019-11-20 07:10:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:55,038 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2019-11-20 07:10:55,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2019-11-20 07:10:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 07:10:55,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:55,042 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-11-20 07:10:55,043 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:55,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:55,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1818183234, now seen corresponding path program 1 times [2019-11-20 07:10:55,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:55,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99008116] [2019-11-20 07:10:55,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:55,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99008116] [2019-11-20 07:10:55,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:55,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:55,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868884191] [2019-11-20 07:10:55,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:55,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:55,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:55,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:55,148 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand 3 states. [2019-11-20 07:10:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:55,310 INFO L93 Difference]: Finished difference Result 329 states and 518 transitions. [2019-11-20 07:10:55,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:55,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-20 07:10:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:55,312 INFO L225 Difference]: With dead ends: 329 [2019-11-20 07:10:55,312 INFO L226 Difference]: Without dead ends: 179 [2019-11-20 07:10:55,314 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-11-20 07:10:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-20 07:10:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-11-20 07:10:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-20 07:10:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2019-11-20 07:10:55,327 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 26 [2019-11-20 07:10:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:55,328 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2019-11-20 07:10:55,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2019-11-20 07:10:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 07:10:55,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:55,330 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-11-20 07:10:55,330 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:55,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1920661961, now seen corresponding path program 1 times [2019-11-20 07:10:55,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:55,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798103056] [2019-11-20 07:10:55,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:55,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798103056] [2019-11-20 07:10:55,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:55,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:55,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34174962] [2019-11-20 07:10:55,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:55,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:55,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:55,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:55,391 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand 3 states. [2019-11-20 07:10:55,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:55,550 INFO L93 Difference]: Finished difference Result 359 states and 559 transitions. [2019-11-20 07:10:55,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:55,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-20 07:10:55,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:55,553 INFO L225 Difference]: With dead ends: 359 [2019-11-20 07:10:55,553 INFO L226 Difference]: Without dead ends: 187 [2019-11-20 07:10:55,554 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-11-20 07:10:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-20 07:10:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-11-20 07:10:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-20 07:10:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2019-11-20 07:10:55,569 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 289 transitions. Word has length 26 [2019-11-20 07:10:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:55,569 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-11-20 07:10:55,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 289 transitions. [2019-11-20 07:10:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 07:10:55,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:55,571 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-11-20 07:10:55,571 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:55,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash -304150793, now seen corresponding path program 1 times [2019-11-20 07:10:55,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:55,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360107745] [2019-11-20 07:10:55,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:55,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360107745] [2019-11-20 07:10:55,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:55,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:55,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454389988] [2019-11-20 07:10:55,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:55,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:55,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:55,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:55,647 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. Second operand 3 states. [2019-11-20 07:10:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:55,826 INFO L93 Difference]: Finished difference Result 364 states and 569 transitions. [2019-11-20 07:10:55,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:55,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-20 07:10:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:55,829 INFO L225 Difference]: With dead ends: 364 [2019-11-20 07:10:55,829 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 07:10:55,830 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-11-20 07:10:55,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 07:10:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-20 07:10:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-20 07:10:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2019-11-20 07:10:55,850 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 290 transitions. Word has length 26 [2019-11-20 07:10:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:55,851 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 290 transitions. [2019-11-20 07:10:55,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2019-11-20 07:10:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 07:10:55,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:55,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, 1] [2019-11-20 07:10:55,853 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:55,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:55,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2065347919, now seen corresponding path program 1 times [2019-11-20 07:10:55,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:55,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935170971] [2019-11-20 07:10:55,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:55,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935170971] [2019-11-20 07:10:55,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:55,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:55,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367785726] [2019-11-20 07:10:55,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:55,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:55,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:55,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:55,925 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand 3 states. [2019-11-20 07:10:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:56,078 INFO L93 Difference]: Finished difference Result 375 states and 581 transitions. [2019-11-20 07:10:56,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:56,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 07:10:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:56,081 INFO L225 Difference]: With dead ends: 375 [2019-11-20 07:10:56,081 INFO L226 Difference]: Without dead ends: 196 [2019-11-20 07:10:56,082 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-11-20 07:10:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-20 07:10:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-20 07:10:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-20 07:10:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2019-11-20 07:10:56,093 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 27 [2019-11-20 07:10:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:56,094 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2019-11-20 07:10:56,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2019-11-20 07:10:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 07:10:56,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:56,096 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] [2019-11-20 07:10:56,096 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:56,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1768037659, now seen corresponding path program 1 times [2019-11-20 07:10:56,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:56,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615059497] [2019-11-20 07:10:56,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:56,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615059497] [2019-11-20 07:10:56,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:56,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:56,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765334104] [2019-11-20 07:10:56,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:56,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:56,133 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand 3 states. [2019-11-20 07:10:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:56,289 INFO L93 Difference]: Finished difference Result 375 states and 577 transitions. [2019-11-20 07:10:56,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:56,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-20 07:10:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:56,292 INFO L225 Difference]: With dead ends: 375 [2019-11-20 07:10:56,292 INFO L226 Difference]: Without dead ends: 196 [2019-11-20 07:10:56,293 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-11-20 07:10:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-20 07:10:56,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-20 07:10:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-20 07:10:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 286 transitions. [2019-11-20 07:10:56,305 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 286 transitions. Word has length 28 [2019-11-20 07:10:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:56,305 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 286 transitions. [2019-11-20 07:10:56,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 286 transitions. [2019-11-20 07:10:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 07:10:56,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:56,316 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] [2019-11-20 07:10:56,317 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:56,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1213962132, now seen corresponding path program 1 times [2019-11-20 07:10:56,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:56,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786813476] [2019-11-20 07:10:56,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:56,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786813476] [2019-11-20 07:10:56,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:56,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:56,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505552478] [2019-11-20 07:10:56,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:56,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:56,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:56,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:56,376 INFO L87 Difference]: Start difference. First operand 186 states and 286 transitions. Second operand 3 states. [2019-11-20 07:10:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:56,502 INFO L93 Difference]: Finished difference Result 375 states and 573 transitions. [2019-11-20 07:10:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:56,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-20 07:10:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:56,504 INFO L225 Difference]: With dead ends: 375 [2019-11-20 07:10:56,504 INFO L226 Difference]: Without dead ends: 196 [2019-11-20 07:10:56,505 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-11-20 07:10:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-20 07:10:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-20 07:10:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-20 07:10:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 284 transitions. [2019-11-20 07:10:56,514 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 284 transitions. Word has length 29 [2019-11-20 07:10:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:56,516 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 284 transitions. [2019-11-20 07:10:56,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 284 transitions. [2019-11-20 07:10:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 07:10:56,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:56,519 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] [2019-11-20 07:10:56,519 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:56,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1639645429, now seen corresponding path program 1 times [2019-11-20 07:10:56,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:56,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999854269] [2019-11-20 07:10:56,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:56,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999854269] [2019-11-20 07:10:56,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:56,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:10:56,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590275333] [2019-11-20 07:10:56,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:56,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:56,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:56,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:56,595 INFO L87 Difference]: Start difference. First operand 186 states and 284 transitions. Second operand 4 states. [2019-11-20 07:10:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:56,873 INFO L93 Difference]: Finished difference Result 571 states and 870 transitions. [2019-11-20 07:10:56,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:10:56,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-20 07:10:56,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:56,876 INFO L225 Difference]: With dead ends: 571 [2019-11-20 07:10:56,876 INFO L226 Difference]: Without dead ends: 392 [2019-11-20 07:10:56,877 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-11-20 07:10:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-20 07:10:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 356. [2019-11-20 07:10:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-20 07:10:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 542 transitions. [2019-11-20 07:10:56,902 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 542 transitions. Word has length 29 [2019-11-20 07:10:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:56,902 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 542 transitions. [2019-11-20 07:10:56,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 542 transitions. [2019-11-20 07:10:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 07:10:56,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:56,904 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] [2019-11-20 07:10:56,904 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash -356314719, now seen corresponding path program 1 times [2019-11-20 07:10:56,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:56,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894832362] [2019-11-20 07:10:56,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:56,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894832362] [2019-11-20 07:10:56,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:56,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:56,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651465970] [2019-11-20 07:10:56,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:56,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:56,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:56,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:56,953 INFO L87 Difference]: Start difference. First operand 356 states and 542 transitions. Second operand 3 states. [2019-11-20 07:10:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:57,134 INFO L93 Difference]: Finished difference Result 780 states and 1196 transitions. [2019-11-20 07:10:57,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:57,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-20 07:10:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:57,139 INFO L225 Difference]: With dead ends: 780 [2019-11-20 07:10:57,140 INFO L226 Difference]: Without dead ends: 431 [2019-11-20 07:10:57,141 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-11-20 07:10:57,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-20 07:10:57,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2019-11-20 07:10:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-20 07:10:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 629 transitions. [2019-11-20 07:10:57,160 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 629 transitions. Word has length 32 [2019-11-20 07:10:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:57,161 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 629 transitions. [2019-11-20 07:10:57,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 629 transitions. [2019-11-20 07:10:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 07:10:57,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:57,163 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] [2019-11-20 07:10:57,163 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:57,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:57,164 INFO L82 PathProgramCache]: Analyzing trace with hash 863724629, now seen corresponding path program 1 times [2019-11-20 07:10:57,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:57,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638126575] [2019-11-20 07:10:57,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:57,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638126575] [2019-11-20 07:10:57,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:57,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:57,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705850756] [2019-11-20 07:10:57,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:57,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:57,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:57,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:57,207 INFO L87 Difference]: Start difference. First operand 411 states and 629 transitions. Second operand 3 states. [2019-11-20 07:10:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:57,382 INFO L93 Difference]: Finished difference Result 857 states and 1320 transitions. [2019-11-20 07:10:57,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:57,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-20 07:10:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:57,386 INFO L225 Difference]: With dead ends: 857 [2019-11-20 07:10:57,386 INFO L226 Difference]: Without dead ends: 453 [2019-11-20 07:10:57,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-11-20 07:10:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-20 07:10:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 433. [2019-11-20 07:10:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-20 07:10:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 669 transitions. [2019-11-20 07:10:57,416 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 669 transitions. Word has length 33 [2019-11-20 07:10:57,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:57,418 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 669 transitions. [2019-11-20 07:10:57,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 669 transitions. [2019-11-20 07:10:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 07:10:57,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:57,420 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] [2019-11-20 07:10:57,420 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131601, now seen corresponding path program 1 times [2019-11-20 07:10:57,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:57,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339830357] [2019-11-20 07:10:57,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:57,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339830357] [2019-11-20 07:10:57,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:57,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:57,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328148817] [2019-11-20 07:10:57,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:57,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:57,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:57,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:57,463 INFO L87 Difference]: Start difference. First operand 433 states and 669 transitions. Second operand 3 states. [2019-11-20 07:10:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:57,656 INFO L93 Difference]: Finished difference Result 924 states and 1432 transitions. [2019-11-20 07:10:57,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:57,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-20 07:10:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:57,661 INFO L225 Difference]: With dead ends: 924 [2019-11-20 07:10:57,661 INFO L226 Difference]: Without dead ends: 498 [2019-11-20 07:10:57,662 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-11-20 07:10:57,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-20 07:10:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 488. [2019-11-20 07:10:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-20 07:10:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 759 transitions. [2019-11-20 07:10:57,684 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 759 transitions. Word has length 39 [2019-11-20 07:10:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:57,684 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 759 transitions. [2019-11-20 07:10:57,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 759 transitions. [2019-11-20 07:10:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 07:10:57,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:57,686 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] [2019-11-20 07:10:57,686 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:57,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:57,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430936, now seen corresponding path program 1 times [2019-11-20 07:10:57,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:57,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373857925] [2019-11-20 07:10:57,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:57,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373857925] [2019-11-20 07:10:57,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:57,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:57,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603224893] [2019-11-20 07:10:57,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:57,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:57,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:57,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:57,726 INFO L87 Difference]: Start difference. First operand 488 states and 759 transitions. Second operand 3 states. [2019-11-20 07:10:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:57,927 INFO L93 Difference]: Finished difference Result 991 states and 1544 transitions. [2019-11-20 07:10:57,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:57,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-20 07:10:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:57,931 INFO L225 Difference]: With dead ends: 991 [2019-11-20 07:10:57,931 INFO L226 Difference]: Without dead ends: 510 [2019-11-20 07:10:57,932 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-11-20 07:10:57,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-20 07:10:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 500. [2019-11-20 07:10:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-20 07:10:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 781 transitions. [2019-11-20 07:10:57,952 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 781 transitions. Word has length 40 [2019-11-20 07:10:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:57,952 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 781 transitions. [2019-11-20 07:10:57,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 781 transitions. [2019-11-20 07:10:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 07:10:57,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:57,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:57,955 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:57,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:57,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1491732218, now seen corresponding path program 1 times [2019-11-20 07:10:57,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:57,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253093533] [2019-11-20 07:10:57,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:58,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253093533] [2019-11-20 07:10:58,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:58,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:58,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935955149] [2019-11-20 07:10:58,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:58,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:58,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:58,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:58,011 INFO L87 Difference]: Start difference. First operand 500 states and 781 transitions. Second operand 3 states. [2019-11-20 07:10:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:58,177 INFO L93 Difference]: Finished difference Result 1007 states and 1574 transitions. [2019-11-20 07:10:58,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:58,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-20 07:10:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:58,182 INFO L225 Difference]: With dead ends: 1007 [2019-11-20 07:10:58,182 INFO L226 Difference]: Without dead ends: 514 [2019-11-20 07:10:58,183 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-11-20 07:10:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-20 07:10:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2019-11-20 07:10:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-20 07:10:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 777 transitions. [2019-11-20 07:10:58,207 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 777 transitions. Word has length 60 [2019-11-20 07:10:58,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:58,208 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 777 transitions. [2019-11-20 07:10:58,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 777 transitions. [2019-11-20 07:10:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 07:10:58,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:58,210 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:58,210 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:58,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:58,211 INFO L82 PathProgramCache]: Analyzing trace with hash -892846741, now seen corresponding path program 1 times [2019-11-20 07:10:58,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:58,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019751004] [2019-11-20 07:10:58,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 07:10:58,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019751004] [2019-11-20 07:10:58,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:58,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:58,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017898175] [2019-11-20 07:10:58,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:58,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:58,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:58,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:58,249 INFO L87 Difference]: Start difference. First operand 500 states and 777 transitions. Second operand 3 states. [2019-11-20 07:10:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:58,414 INFO L93 Difference]: Finished difference Result 1035 states and 1604 transitions. [2019-11-20 07:10:58,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:58,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-20 07:10:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:58,417 INFO L225 Difference]: With dead ends: 1035 [2019-11-20 07:10:58,418 INFO L226 Difference]: Without dead ends: 542 [2019-11-20 07:10:58,419 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-11-20 07:10:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-20 07:10:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 532. [2019-11-20 07:10:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-20 07:10:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 820 transitions. [2019-11-20 07:10:58,444 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 820 transitions. Word has length 61 [2019-11-20 07:10:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:58,445 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 820 transitions. [2019-11-20 07:10:58,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 820 transitions. [2019-11-20 07:10:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 07:10:58,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:58,447 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:58,447 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:58,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:58,448 INFO L82 PathProgramCache]: Analyzing trace with hash 27094997, now seen corresponding path program 1 times [2019-11-20 07:10:58,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:58,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141962237] [2019-11-20 07:10:58,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:58,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141962237] [2019-11-20 07:10:58,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:58,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:58,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018278437] [2019-11-20 07:10:58,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:58,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:58,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:58,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:58,480 INFO L87 Difference]: Start difference. First operand 532 states and 820 transitions. Second operand 3 states. [2019-11-20 07:10:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:58,653 INFO L93 Difference]: Finished difference Result 1095 states and 1685 transitions. [2019-11-20 07:10:58,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:58,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-20 07:10:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:58,657 INFO L225 Difference]: With dead ends: 1095 [2019-11-20 07:10:58,658 INFO L226 Difference]: Without dead ends: 570 [2019-11-20 07:10:58,660 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-11-20 07:10:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-20 07:10:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2019-11-20 07:10:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-20 07:10:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 873 transitions. [2019-11-20 07:10:58,685 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 873 transitions. Word has length 61 [2019-11-20 07:10:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:58,685 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 873 transitions. [2019-11-20 07:10:58,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 873 transitions. [2019-11-20 07:10:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-20 07:10:58,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:58,687 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:58,687 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:58,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:58,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1141694985, now seen corresponding path program 1 times [2019-11-20 07:10:58,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:58,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805908161] [2019-11-20 07:10:58,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 07:10:58,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805908161] [2019-11-20 07:10:58,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:58,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:58,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346072872] [2019-11-20 07:10:58,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:58,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:58,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:58,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:58,724 INFO L87 Difference]: Start difference. First operand 570 states and 873 transitions. Second operand 3 states. [2019-11-20 07:10:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:58,887 INFO L93 Difference]: Finished difference Result 1143 states and 1749 transitions. [2019-11-20 07:10:58,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:58,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-20 07:10:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:58,891 INFO L225 Difference]: With dead ends: 1143 [2019-11-20 07:10:58,891 INFO L226 Difference]: Without dead ends: 580 [2019-11-20 07:10:58,892 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-11-20 07:10:58,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-20 07:10:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 570. [2019-11-20 07:10:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-20 07:10:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 868 transitions. [2019-11-20 07:10:58,917 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 868 transitions. Word has length 62 [2019-11-20 07:10:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:58,917 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 868 transitions. [2019-11-20 07:10:58,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 868 transitions. [2019-11-20 07:10:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 07:10:58,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:58,919 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:58,919 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:58,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1688729156, now seen corresponding path program 1 times [2019-11-20 07:10:58,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:58,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135235442] [2019-11-20 07:10:58,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:58,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135235442] [2019-11-20 07:10:58,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:58,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:58,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224700980] [2019-11-20 07:10:58,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:58,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:58,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:58,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:58,957 INFO L87 Difference]: Start difference. First operand 570 states and 868 transitions. Second operand 3 states. [2019-11-20 07:10:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:59,158 INFO L93 Difference]: Finished difference Result 1180 states and 1793 transitions. [2019-11-20 07:10:59,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:59,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 07:10:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:59,162 INFO L225 Difference]: With dead ends: 1180 [2019-11-20 07:10:59,162 INFO L226 Difference]: Without dead ends: 617 [2019-11-20 07:10:59,164 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-11-20 07:10:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-20 07:10:59,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-11-20 07:10:59,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-20 07:10:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 929 transitions. [2019-11-20 07:10:59,194 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 929 transitions. Word has length 73 [2019-11-20 07:10:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:59,194 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 929 transitions. [2019-11-20 07:10:59,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 929 transitions. [2019-11-20 07:10:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 07:10:59,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:59,196 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:59,196 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:59,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:59,197 INFO L82 PathProgramCache]: Analyzing trace with hash -628849429, now seen corresponding path program 1 times [2019-11-20 07:10:59,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:59,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268251303] [2019-11-20 07:10:59,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:59,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268251303] [2019-11-20 07:10:59,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:59,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:59,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650527420] [2019-11-20 07:10:59,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:59,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:59,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:59,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:59,242 INFO L87 Difference]: Start difference. First operand 613 states and 929 transitions. Second operand 3 states. [2019-11-20 07:10:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:59,444 INFO L93 Difference]: Finished difference Result 1223 states and 1851 transitions. [2019-11-20 07:10:59,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:59,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-20 07:10:59,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:59,448 INFO L225 Difference]: With dead ends: 1223 [2019-11-20 07:10:59,448 INFO L226 Difference]: Without dead ends: 617 [2019-11-20 07:10:59,450 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-11-20 07:10:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-20 07:10:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-11-20 07:10:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-20 07:10:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 926 transitions. [2019-11-20 07:10:59,477 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 926 transitions. Word has length 74 [2019-11-20 07:10:59,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:59,478 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 926 transitions. [2019-11-20 07:10:59,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:59,478 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 926 transitions. [2019-11-20 07:10:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:10:59,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:59,480 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:59,480 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:59,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:59,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1361446465, now seen corresponding path program 1 times [2019-11-20 07:10:59,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:59,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139068717] [2019-11-20 07:10:59,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 07:10:59,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139068717] [2019-11-20 07:10:59,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:59,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:59,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294822954] [2019-11-20 07:10:59,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:59,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:59,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:59,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:59,525 INFO L87 Difference]: Start difference. First operand 613 states and 926 transitions. Second operand 3 states. [2019-11-20 07:10:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:59,681 INFO L93 Difference]: Finished difference Result 1255 states and 1894 transitions. [2019-11-20 07:10:59,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:59,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:10:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:59,686 INFO L225 Difference]: With dead ends: 1255 [2019-11-20 07:10:59,686 INFO L226 Difference]: Without dead ends: 649 [2019-11-20 07:10:59,687 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-11-20 07:10:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-20 07:10:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-11-20 07:10:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-20 07:10:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 960 transitions. [2019-11-20 07:10:59,716 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 960 transitions. Word has length 83 [2019-11-20 07:10:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:59,716 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 960 transitions. [2019-11-20 07:10:59,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 960 transitions. [2019-11-20 07:10:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 07:10:59,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:59,718 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:59,719 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:59,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:59,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1716915501, now seen corresponding path program 1 times [2019-11-20 07:10:59,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:59,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963226984] [2019-11-20 07:10:59,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 07:10:59,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963226984] [2019-11-20 07:10:59,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:59,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:59,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663868344] [2019-11-20 07:10:59,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:59,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:59,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:59,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:59,748 INFO L87 Difference]: Start difference. First operand 641 states and 960 transitions. Second operand 3 states. [2019-11-20 07:10:59,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:59,906 INFO L93 Difference]: Finished difference Result 1283 states and 1921 transitions. [2019-11-20 07:10:59,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:10:59,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 07:10:59,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:59,910 INFO L225 Difference]: With dead ends: 1283 [2019-11-20 07:10:59,910 INFO L226 Difference]: Without dead ends: 649 [2019-11-20 07:10:59,912 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-11-20 07:10:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-20 07:10:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-11-20 07:10:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-20 07:10:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2019-11-20 07:10:59,940 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 84 [2019-11-20 07:10:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:59,940 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2019-11-20 07:10:59,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:10:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2019-11-20 07:10:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 07:10:59,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:59,942 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:59,943 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1450581597, now seen corresponding path program 1 times [2019-11-20 07:10:59,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:59,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835322311] [2019-11-20 07:10:59,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 07:10:59,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835322311] [2019-11-20 07:10:59,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:59,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:10:59,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748668904] [2019-11-20 07:10:59,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:10:59,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:59,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:10:59,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:10:59,972 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand 3 states. [2019-11-20 07:11:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:00,139 INFO L93 Difference]: Finished difference Result 1315 states and 1948 transitions. [2019-11-20 07:11:00,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:11:00,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-20 07:11:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:00,143 INFO L225 Difference]: With dead ends: 1315 [2019-11-20 07:11:00,144 INFO L226 Difference]: Without dead ends: 681 [2019-11-20 07:11:00,145 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-11-20 07:11:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-11-20 07:11:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-11-20 07:11:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-20 07:11:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 997 transitions. [2019-11-20 07:11:00,174 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 997 transitions. Word has length 88 [2019-11-20 07:11:00,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:00,175 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 997 transitions. [2019-11-20 07:11:00,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:11:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 997 transitions. [2019-11-20 07:11:00,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 07:11:00,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:00,177 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:00,177 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:00,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:00,178 INFO L82 PathProgramCache]: Analyzing trace with hash -398439497, now seen corresponding path program 1 times [2019-11-20 07:11:00,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:00,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508421220] [2019-11-20 07:11:00,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 07:11:00,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508421220] [2019-11-20 07:11:00,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:00,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:11:00,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902881788] [2019-11-20 07:11:00,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:11:00,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:11:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:11:00,207 INFO L87 Difference]: Start difference. First operand 677 states and 997 transitions. Second operand 3 states. [2019-11-20 07:11:00,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:00,378 INFO L93 Difference]: Finished difference Result 1351 states and 1987 transitions. [2019-11-20 07:11:00,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:11:00,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-20 07:11:00,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:00,383 INFO L225 Difference]: With dead ends: 1351 [2019-11-20 07:11:00,383 INFO L226 Difference]: Without dead ends: 681 [2019-11-20 07:11:00,384 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-11-20 07:11:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-11-20 07:11:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-11-20 07:11:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-20 07:11:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 992 transitions. [2019-11-20 07:11:00,414 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 992 transitions. Word has length 89 [2019-11-20 07:11:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:00,414 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 992 transitions. [2019-11-20 07:11:00,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:11:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 992 transitions. [2019-11-20 07:11:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 07:11:00,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:00,417 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:00,417 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:00,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:00,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1868895208, now seen corresponding path program 1 times [2019-11-20 07:11:00,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:00,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21854891] [2019-11-20 07:11:00,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 07:11:00,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21854891] [2019-11-20 07:11:00,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:00,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:11:00,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085885568] [2019-11-20 07:11:00,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:11:00,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:00,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:11:00,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:11:00,455 INFO L87 Difference]: Start difference. First operand 677 states and 992 transitions. Second operand 3 states. [2019-11-20 07:11:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:00,503 INFO L93 Difference]: Finished difference Result 2003 states and 2928 transitions. [2019-11-20 07:11:00,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:11:00,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 07:11:00,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:00,510 INFO L225 Difference]: With dead ends: 2003 [2019-11-20 07:11:00,511 INFO L226 Difference]: Without dead ends: 1333 [2019-11-20 07:11:00,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:11:00,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-11-20 07:11:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 679. [2019-11-20 07:11:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-11-20 07:11:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 994 transitions. [2019-11-20 07:11:00,549 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 994 transitions. Word has length 100 [2019-11-20 07:11:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:00,550 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 994 transitions. [2019-11-20 07:11:00,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:11:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 994 transitions. [2019-11-20 07:11:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 07:11:00,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:00,552 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:00,552 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:00,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:00,553 INFO L82 PathProgramCache]: Analyzing trace with hash 589031530, now seen corresponding path program 1 times [2019-11-20 07:11:00,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:00,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344259843] [2019-11-20 07:11:00,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 07:11:00,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344259843] [2019-11-20 07:11:00,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:00,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:11:00,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795352316] [2019-11-20 07:11:00,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:11:00,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:00,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:11:00,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:11:00,608 INFO L87 Difference]: Start difference. First operand 679 states and 994 transitions. Second operand 3 states. [2019-11-20 07:11:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:00,646 INFO L93 Difference]: Finished difference Result 1362 states and 1992 transitions. [2019-11-20 07:11:00,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:11:00,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 07:11:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:00,650 INFO L225 Difference]: With dead ends: 1362 [2019-11-20 07:11:00,651 INFO L226 Difference]: Without dead ends: 690 [2019-11-20 07:11:00,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:11:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-11-20 07:11:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 677. [2019-11-20 07:11:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-20 07:11:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 987 transitions. [2019-11-20 07:11:00,682 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 987 transitions. Word has length 100 [2019-11-20 07:11:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:00,683 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 987 transitions. [2019-11-20 07:11:00,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:11:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 987 transitions. [2019-11-20 07:11:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 07:11:00,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:00,685 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:00,685 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:00,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:00,686 INFO L82 PathProgramCache]: Analyzing trace with hash 303396910, now seen corresponding path program 1 times [2019-11-20 07:11:00,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:00,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328280510] [2019-11-20 07:11:00,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 07:11:00,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328280510] [2019-11-20 07:11:00,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:00,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:11:00,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523617688] [2019-11-20 07:11:00,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:11:00,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:00,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:11:00,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:11:00,729 INFO L87 Difference]: Start difference. First operand 677 states and 987 transitions. Second operand 3 states. [2019-11-20 07:11:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:00,820 INFO L93 Difference]: Finished difference Result 2017 states and 2939 transitions. [2019-11-20 07:11:00,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:11:00,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-20 07:11:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:00,828 INFO L225 Difference]: With dead ends: 2017 [2019-11-20 07:11:00,828 INFO L226 Difference]: Without dead ends: 1347 [2019-11-20 07:11:00,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:11:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-11-20 07:11:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1345. [2019-11-20 07:11:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2019-11-20 07:11:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1950 transitions. [2019-11-20 07:11:00,890 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1950 transitions. Word has length 101 [2019-11-20 07:11:00,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:00,890 INFO L462 AbstractCegarLoop]: Abstraction has 1345 states and 1950 transitions. [2019-11-20 07:11:00,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:11:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1950 transitions. [2019-11-20 07:11:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 07:11:00,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:00,893 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:00,894 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:00,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:00,894 INFO L82 PathProgramCache]: Analyzing trace with hash -283409104, now seen corresponding path program 1 times [2019-11-20 07:11:00,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:00,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216406385] [2019-11-20 07:11:00,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:11:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:11:01,008 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:11:01,008 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 07:11:01,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:11:01 BoogieIcfgContainer [2019-11-20 07:11:01,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:11:01,076 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:11:01,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:11:01,077 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:11:01,077 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:10:54" (3/4) ... [2019-11-20 07:11:01,080 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 07:11:01,160 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_87dfa900-a7d2-4896-b0be-f30c66ef099c/bin/uautomizer/witness.graphml [2019-11-20 07:11:01,160 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:11:01,163 INFO L168 Benchmark]: Toolchain (without parser) took 8317.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 99.8 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:01,163 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:11:01,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:01,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.66 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:01,164 INFO L168 Benchmark]: Boogie Preprocessor took 39.92 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:01,165 INFO L168 Benchmark]: RCFGBuilder took 914.14 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:01,165 INFO L168 Benchmark]: TraceAbstraction took 6739.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 96.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.1 MB). Peak memory consumption was 67.3 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:01,166 INFO L168 Benchmark]: Witness Printer took 84.34 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:01,168 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 477.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.66 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.92 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 914.14 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6739.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 96.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.1 MB). Peak memory consumption was 67.3 MB. Max. memory is 11.5 GB. * Witness Printer took 84.34 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 642]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L647] int s ; [L648] int tmp ; [L652] 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 ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength ; [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 = __VERIFIER_nondet_int() ; [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__state = initial_state [L73] blastFlag = 0 [L74] tmp = __VERIFIER_nondet_int() [L75] Time = tmp [L76] cb = 0 [L77] ret = -1 [L78] skip = 0 [L79] got_new_session = 0 [L80] COND TRUE s__info_callback != 0 [L81] cb = s__info_callback [L87] s__in_handshake ++ [L88] COND FALSE !(tmp___1 + 12288) [L93] COND FALSE !(s__cert == 0) [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND TRUE s__state == 8464 [L270] s__shutdown = 0 [L271] ret = __VERIFIER_nondet_int() [L272] COND TRUE blastFlag == 0 [L273] blastFlag = 1 [L275] COND FALSE !(ret <= 0) [L278] got_new_session = 1 [L279] s__state = 8496 [L280] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND TRUE s__state == 8496 [L284] ret = __VERIFIER_nondet_int() [L285] COND TRUE blastFlag == 1 [L286] blastFlag = 2 [L288] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 8512 [L296] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND TRUE s__state == 8512 [L301] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L302] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L303] COND TRUE __cil_tmp56 + 256UL [L304] skip = 1 [L315] s__state = 8528 [L316] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND FALSE !(s__state == 8512) [L142] COND FALSE !(s__state == 8513) [L145] COND TRUE s__state == 8528 [L320] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L321] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L323] __cil_tmp57 = (unsigned long )s__options [L324] COND TRUE __cil_tmp57 + 2097152UL [L325] s__s3__tmp__use_rsa_tmp = 1 [L330] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L357] ret = __VERIFIER_nondet_int() [L358] COND FALSE !(blastFlag == 6) [L361] COND FALSE !(ret <= 0) [L378] s__state = 8544 [L379] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND TRUE ! s__s3__tmp__reuse_message [L601] COND TRUE ! skip [L602] COND TRUE state == 8528 [L603] COND TRUE s__state == 8544 [L604] COND TRUE tmp___7 != 1024 [L605] COND TRUE tmp___7 != 512 [L606] COND TRUE __cil_tmp58 != 4294967294 [L607] COND TRUE l != 4294967266 [L642] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 1 error locations. Result: UNSAFE, OverallTime: 6.6s, OverallIterations: 26, TraceHistogramMax: 4, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4244 SDtfs, 4375 SDslu, 1279 SDs, 0 SdLazy, 2053 SolverSat, 917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1345occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1371 ConstructedInterpolants, 0 QuantifiedInterpolants, 179497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 646/646 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...