./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/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 f4c57aae7ed3dd683b199a99be2cffcf6f23506e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-cad4683 [2019-11-15 23:13:51,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:13:51,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:13:51,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:13:51,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:13:51,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:13:51,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:13:51,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:13:51,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:13:51,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:13:51,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:13:51,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:13:51,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:13:51,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:13:51,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:13:51,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:13:51,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:13:51,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:13:51,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:13:51,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:13:51,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:13:51,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:13:51,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:13:51,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:13:51,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:13:51,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:13:51,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:13:51,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:13:51,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:13:51,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:13:51,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:13:51,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:13:51,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:13:51,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:13:51,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:13:51,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:13:51,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:13:51,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:13:51,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:13:51,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:13:51,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:13:51,693 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:13:51,712 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:13:51,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:13:51,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:13:51,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:13:51,714 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:13:51,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:13:51,715 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:13:51,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:13:51,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:13:51,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:13:51,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:13:51,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:13:51,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:13:51,717 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:13:51,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:13:51,718 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:13:51,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:13:51,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:13:51,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:13:51,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:13:51,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:13:51,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:13:51,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:13:51,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:13:51,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:13:51,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:13:51,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:13:51,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:13:51,722 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_457ec2d7-a2a2-4b48-9a7c-04182133b582/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 -> f4c57aae7ed3dd683b199a99be2cffcf6f23506e [2019-11-15 23:13:51,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:13:51,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:13:51,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:13:51,796 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:13:51,797 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:13:51,799 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-11-15 23:13:51,871 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/data/7c7b740d6/8a4996bc4d3c41968f00637ecf77f0e0/FLAGb0feee034 [2019-11-15 23:13:52,348 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:13:52,349 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-11-15 23:13:52,369 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/data/7c7b740d6/8a4996bc4d3c41968f00637ecf77f0e0/FLAGb0feee034 [2019-11-15 23:13:52,875 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/data/7c7b740d6/8a4996bc4d3c41968f00637ecf77f0e0 [2019-11-15 23:13:52,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:13:52,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:13:52,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:13:52,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:13:52,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:13:52,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:13:52" (1/1) ... [2019-11-15 23:13:52,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e0d3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:52, skipping insertion in model container [2019-11-15 23:13:52,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:13:52" (1/1) ... [2019-11-15 23:13:52,897 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:13:52,949 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:13:53,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:13:53,322 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:13:53,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:13:53,432 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:13:53,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:53 WrapperNode [2019-11-15 23:13:53,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:13:53,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:13:53,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:13:53,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:13:53,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:53" (1/1) ... [2019-11-15 23:13:53,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:53" (1/1) ... [2019-11-15 23:13:53,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:13:53,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:13:53,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:13:53,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:13:53,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:53" (1/1) ... [2019-11-15 23:13:53,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:53" (1/1) ... [2019-11-15 23:13:53,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:53" (1/1) ... [2019-11-15 23:13:53,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:53" (1/1) ... [2019-11-15 23:13:53,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:53" (1/1) ... [2019-11-15 23:13:53,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:53" (1/1) ... [2019-11-15 23:13:53,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:53" (1/1) ... [2019-11-15 23:13:53,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:13:53,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:13:53,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:13:53,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:13:53,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/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-15 23:13:53,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:13:53,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:13:53,784 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:13:54,752 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 23:13:54,753 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 23:13:54,755 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:13:54,755 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:13:54,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:13:54 BoogieIcfgContainer [2019-11-15 23:13:54,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:13:54,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:13:54,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:13:54,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:13:54,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:13:52" (1/3) ... [2019-11-15 23:13:54,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e57a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:13:54, skipping insertion in model container [2019-11-15 23:13:54,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:13:53" (2/3) ... [2019-11-15 23:13:54,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e57a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:13:54, skipping insertion in model container [2019-11-15 23:13:54,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:13:54" (3/3) ... [2019-11-15 23:13:54,772 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_11.cil.c [2019-11-15 23:13:54,781 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:13:54,789 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:13:54,799 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:13:54,829 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:13:54,830 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:13:54,830 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:13:54,832 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:13:54,832 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:13:54,832 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:13:54,833 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:13:54,833 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:13:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 23:13:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:13:54,871 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:54,872 INFO L380 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-15 23:13:54,875 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:54,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1603119947, now seen corresponding path program 1 times [2019-11-15 23:13:54,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:54,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726500669] [2019-11-15 23:13:54,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:54,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:54,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:55,110 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-15 23:13:55,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726500669] [2019-11-15 23:13:55,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:55,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:55,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658244466] [2019-11-15 23:13:55,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:55,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:55,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:55,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:55,136 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-15 23:13:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:55,460 INFO L93 Difference]: Finished difference Result 315 states and 541 transitions. [2019-11-15 23:13:55,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:55,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:13:55,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:55,476 INFO L225 Difference]: With dead ends: 315 [2019-11-15 23:13:55,476 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 23:13:55,480 INFO L600 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-15 23:13:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 23:13:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-11-15 23:13:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 23:13:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 240 transitions. [2019-11-15 23:13:55,537 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 240 transitions. Word has length 25 [2019-11-15 23:13:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:55,538 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 240 transitions. [2019-11-15 23:13:55,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 240 transitions. [2019-11-15 23:13:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:13:55,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:55,541 INFO L380 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-15 23:13:55,541 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:55,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1655306444, now seen corresponding path program 1 times [2019-11-15 23:13:55,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:55,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561966917] [2019-11-15 23:13:55,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:55,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:55,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:55,626 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-15 23:13:55,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561966917] [2019-11-15 23:13:55,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:55,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:55,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114875097] [2019-11-15 23:13:55,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:55,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:55,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:55,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:55,631 INFO L87 Difference]: Start difference. First operand 152 states and 240 transitions. Second operand 3 states. [2019-11-15 23:13:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:55,858 INFO L93 Difference]: Finished difference Result 318 states and 501 transitions. [2019-11-15 23:13:55,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:55,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 23:13:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:55,862 INFO L225 Difference]: With dead ends: 318 [2019-11-15 23:13:55,862 INFO L226 Difference]: Without dead ends: 173 [2019-11-15 23:13:55,864 INFO L600 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-15 23:13:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-15 23:13:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-11-15 23:13:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-15 23:13:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2019-11-15 23:13:55,886 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 269 transitions. Word has length 26 [2019-11-15 23:13:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:55,886 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 269 transitions. [2019-11-15 23:13:55,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2019-11-15 23:13:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:13:55,888 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:55,888 INFO L380 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-15 23:13:55,889 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:55,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:55,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2083538751, now seen corresponding path program 1 times [2019-11-15 23:13:55,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:55,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228232019] [2019-11-15 23:13:55,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:55,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:55,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:55,945 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-15 23:13:55,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228232019] [2019-11-15 23:13:55,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:55,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:55,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145310515] [2019-11-15 23:13:55,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:55,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:55,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:55,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:55,948 INFO L87 Difference]: Start difference. First operand 173 states and 269 transitions. Second operand 3 states. [2019-11-15 23:13:56,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:56,178 INFO L93 Difference]: Finished difference Result 347 states and 541 transitions. [2019-11-15 23:13:56,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:56,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 23:13:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:56,182 INFO L225 Difference]: With dead ends: 347 [2019-11-15 23:13:56,182 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 23:13:56,184 INFO L600 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-15 23:13:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 23:13:56,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-11-15 23:13:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-15 23:13:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 280 transitions. [2019-11-15 23:13:56,202 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 280 transitions. Word has length 26 [2019-11-15 23:13:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:56,203 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 280 transitions. [2019-11-15 23:13:56,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 280 transitions. [2019-11-15 23:13:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:13:56,205 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:56,205 INFO L380 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-15 23:13:56,205 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:56,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:56,206 INFO L82 PathProgramCache]: Analyzing trace with hash -467027583, now seen corresponding path program 1 times [2019-11-15 23:13:56,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:56,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111151286] [2019-11-15 23:13:56,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:56,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:56,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:56,306 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-15 23:13:56,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111151286] [2019-11-15 23:13:56,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:56,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:56,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108683003] [2019-11-15 23:13:56,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:56,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:56,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:56,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:56,309 INFO L87 Difference]: Start difference. First operand 179 states and 280 transitions. Second operand 3 states. [2019-11-15 23:13:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:56,505 INFO L93 Difference]: Finished difference Result 352 states and 551 transitions. [2019-11-15 23:13:56,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:56,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 23:13:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:56,508 INFO L225 Difference]: With dead ends: 352 [2019-11-15 23:13:56,509 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 23:13:56,510 INFO L600 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-15 23:13:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 23:13:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-11-15 23:13:56,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 23:13:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 281 transitions. [2019-11-15 23:13:56,552 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 281 transitions. Word has length 26 [2019-11-15 23:13:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:56,553 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 281 transitions. [2019-11-15 23:13:56,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 281 transitions. [2019-11-15 23:13:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:13:56,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:56,558 INFO L380 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-15 23:13:56,559 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:56,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:56,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1902471129, now seen corresponding path program 1 times [2019-11-15 23:13:56,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:56,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736319618] [2019-11-15 23:13:56,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:56,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:56,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:56,643 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-15 23:13:56,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736319618] [2019-11-15 23:13:56,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:56,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:56,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709224228] [2019-11-15 23:13:56,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:56,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:56,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:56,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:56,646 INFO L87 Difference]: Start difference. First operand 180 states and 281 transitions. Second operand 3 states. [2019-11-15 23:13:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:56,839 INFO L93 Difference]: Finished difference Result 363 states and 563 transitions. [2019-11-15 23:13:56,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:56,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 23:13:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:56,841 INFO L225 Difference]: With dead ends: 363 [2019-11-15 23:13:56,841 INFO L226 Difference]: Without dead ends: 190 [2019-11-15 23:13:56,842 INFO L600 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-15 23:13:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-15 23:13:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-15 23:13:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 23:13:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 279 transitions. [2019-11-15 23:13:56,857 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 279 transitions. Word has length 27 [2019-11-15 23:13:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:56,858 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 279 transitions. [2019-11-15 23:13:56,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 279 transitions. [2019-11-15 23:13:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:13:56,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:56,860 INFO L380 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-15 23:13:56,860 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:56,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1605160869, now seen corresponding path program 1 times [2019-11-15 23:13:56,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:56,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937497335] [2019-11-15 23:13:56,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:56,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:56,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:56,899 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-15 23:13:56,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937497335] [2019-11-15 23:13:56,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:56,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:56,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990430205] [2019-11-15 23:13:56,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:56,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:56,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:56,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:56,902 INFO L87 Difference]: Start difference. First operand 180 states and 279 transitions. Second operand 3 states. [2019-11-15 23:13:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:57,092 INFO L93 Difference]: Finished difference Result 363 states and 559 transitions. [2019-11-15 23:13:57,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:57,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 23:13:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:57,095 INFO L225 Difference]: With dead ends: 363 [2019-11-15 23:13:57,095 INFO L226 Difference]: Without dead ends: 190 [2019-11-15 23:13:57,096 INFO L600 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-15 23:13:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-15 23:13:57,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-15 23:13:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 23:13:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 277 transitions. [2019-11-15 23:13:57,108 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 277 transitions. Word has length 28 [2019-11-15 23:13:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:57,108 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 277 transitions. [2019-11-15 23:13:57,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 277 transitions. [2019-11-15 23:13:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:13:57,110 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:57,111 INFO L380 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-15 23:13:57,111 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:57,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:57,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1051085342, now seen corresponding path program 1 times [2019-11-15 23:13:57,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:57,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820966505] [2019-11-15 23:13:57,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:57,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:57,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:57,149 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-15 23:13:57,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820966505] [2019-11-15 23:13:57,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:57,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:57,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919956095] [2019-11-15 23:13:57,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:57,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:57,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:57,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:57,152 INFO L87 Difference]: Start difference. First operand 180 states and 277 transitions. Second operand 3 states. [2019-11-15 23:13:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:57,327 INFO L93 Difference]: Finished difference Result 363 states and 555 transitions. [2019-11-15 23:13:57,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:57,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 23:13:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:57,329 INFO L225 Difference]: With dead ends: 363 [2019-11-15 23:13:57,329 INFO L226 Difference]: Without dead ends: 190 [2019-11-15 23:13:57,330 INFO L600 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-15 23:13:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-15 23:13:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-15 23:13:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 23:13:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2019-11-15 23:13:57,341 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 275 transitions. Word has length 29 [2019-11-15 23:13:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:57,343 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-11-15 23:13:57,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 275 transitions. [2019-11-15 23:13:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:13:57,344 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:57,344 INFO L380 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-15 23:13:57,345 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:57,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:57,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1476768639, now seen corresponding path program 1 times [2019-11-15 23:13:57,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:57,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486097712] [2019-11-15 23:13:57,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:57,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:57,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:57,406 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-15 23:13:57,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486097712] [2019-11-15 23:13:57,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:57,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:13:57,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823987647] [2019-11-15 23:13:57,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:13:57,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:57,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:13:57,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:13:57,408 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. Second operand 4 states. [2019-11-15 23:13:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:57,757 INFO L93 Difference]: Finished difference Result 511 states and 778 transitions. [2019-11-15 23:13:57,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:13:57,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-15 23:13:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:57,761 INFO L225 Difference]: With dead ends: 511 [2019-11-15 23:13:57,761 INFO L226 Difference]: Without dead ends: 338 [2019-11-15 23:13:57,762 INFO L600 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-15 23:13:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-15 23:13:57,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 323. [2019-11-15 23:13:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-15 23:13:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 494 transitions. [2019-11-15 23:13:57,788 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 494 transitions. Word has length 29 [2019-11-15 23:13:57,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:57,789 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 494 transitions. [2019-11-15 23:13:57,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:13:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 494 transitions. [2019-11-15 23:13:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 23:13:57,794 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:57,794 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:13:57,794 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash -91605738, now seen corresponding path program 1 times [2019-11-15 23:13:57,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:57,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245751551] [2019-11-15 23:13:57,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:57,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:57,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:57,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:13:57,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245751551] [2019-11-15 23:13:57,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:57,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:57,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940647112] [2019-11-15 23:13:57,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:57,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:57,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:57,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:57,876 INFO L87 Difference]: Start difference. First operand 323 states and 494 transitions. Second operand 3 states. [2019-11-15 23:13:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:58,126 INFO L93 Difference]: Finished difference Result 698 states and 1074 transitions. [2019-11-15 23:13:58,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:58,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-15 23:13:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:58,131 INFO L225 Difference]: With dead ends: 698 [2019-11-15 23:13:58,132 INFO L226 Difference]: Without dead ends: 382 [2019-11-15 23:13:58,133 INFO L600 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-15 23:13:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-15 23:13:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2019-11-15 23:13:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-15 23:13:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 581 transitions. [2019-11-15 23:13:58,156 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 581 transitions. Word has length 43 [2019-11-15 23:13:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:58,157 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 581 transitions. [2019-11-15 23:13:58,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 581 transitions. [2019-11-15 23:13:58,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:13:58,162 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:58,163 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:13:58,163 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:58,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:58,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033309, now seen corresponding path program 1 times [2019-11-15 23:13:58,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:58,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920737249] [2019-11-15 23:13:58,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:58,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:58,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:58,224 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-15 23:13:58,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920737249] [2019-11-15 23:13:58,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:58,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:58,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651868602] [2019-11-15 23:13:58,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:58,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:58,236 INFO L87 Difference]: Start difference. First operand 374 states and 581 transitions. Second operand 3 states. [2019-11-15 23:13:58,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:58,492 INFO L93 Difference]: Finished difference Result 775 states and 1210 transitions. [2019-11-15 23:13:58,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:58,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 23:13:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:58,497 INFO L225 Difference]: With dead ends: 775 [2019-11-15 23:13:58,497 INFO L226 Difference]: Without dead ends: 406 [2019-11-15 23:13:58,498 INFO L600 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-15 23:13:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-15 23:13:58,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 398. [2019-11-15 23:13:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-15 23:13:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 627 transitions. [2019-11-15 23:13:58,519 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 627 transitions. Word has length 44 [2019-11-15 23:13:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:58,520 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 627 transitions. [2019-11-15 23:13:58,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 627 transitions. [2019-11-15 23:13:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:13:58,522 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:58,522 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:13:58,522 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:58,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:58,523 INFO L82 PathProgramCache]: Analyzing trace with hash 501139110, now seen corresponding path program 1 times [2019-11-15 23:13:58,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:58,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615663218] [2019-11-15 23:13:58,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:58,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:58,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:13:58,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615663218] [2019-11-15 23:13:58,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:58,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:58,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134553207] [2019-11-15 23:13:58,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:58,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:58,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:58,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:58,557 INFO L87 Difference]: Start difference. First operand 398 states and 627 transitions. Second operand 3 states. [2019-11-15 23:13:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:58,756 INFO L93 Difference]: Finished difference Result 829 states and 1310 transitions. [2019-11-15 23:13:58,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:58,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-15 23:13:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:58,761 INFO L225 Difference]: With dead ends: 829 [2019-11-15 23:13:58,761 INFO L226 Difference]: Without dead ends: 438 [2019-11-15 23:13:58,762 INFO L600 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-15 23:13:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-15 23:13:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-11-15 23:13:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-11-15 23:13:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 692 transitions. [2019-11-15 23:13:58,785 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 692 transitions. Word has length 54 [2019-11-15 23:13:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:58,786 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 692 transitions. [2019-11-15 23:13:58,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 692 transitions. [2019-11-15 23:13:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:13:58,788 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:58,788 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 23:13:58,788 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:58,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:58,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1234673389, now seen corresponding path program 1 times [2019-11-15 23:13:58,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:58,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059421787] [2019-11-15 23:13:58,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:58,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:58,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:13:58,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059421787] [2019-11-15 23:13:58,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:58,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:58,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41621153] [2019-11-15 23:13:58,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:58,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:58,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:58,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:58,842 INFO L87 Difference]: Start difference. First operand 438 states and 692 transitions. Second operand 3 states. [2019-11-15 23:13:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:59,036 INFO L93 Difference]: Finished difference Result 911 states and 1440 transitions. [2019-11-15 23:13:59,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:59,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-15 23:13:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:59,040 INFO L225 Difference]: With dead ends: 911 [2019-11-15 23:13:59,040 INFO L226 Difference]: Without dead ends: 480 [2019-11-15 23:13:59,041 INFO L600 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-15 23:13:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-15 23:13:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-11-15 23:13:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-15 23:13:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 752 transitions. [2019-11-15 23:13:59,065 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 752 transitions. Word has length 81 [2019-11-15 23:13:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:59,066 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 752 transitions. [2019-11-15 23:13:59,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:59,066 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 752 transitions. [2019-11-15 23:13:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:13:59,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:59,068 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 23:13:59,068 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:59,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:59,068 INFO L82 PathProgramCache]: Analyzing trace with hash -337353345, now seen corresponding path program 1 times [2019-11-15 23:13:59,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:59,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610620120] [2019-11-15 23:13:59,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:59,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:59,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:13:59,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610620120] [2019-11-15 23:13:59,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:59,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:59,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708414413] [2019-11-15 23:13:59,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:59,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:59,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:59,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:59,108 INFO L87 Difference]: Start difference. First operand 476 states and 752 transitions. Second operand 3 states. [2019-11-15 23:13:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:59,292 INFO L93 Difference]: Finished difference Result 949 states and 1497 transitions. [2019-11-15 23:13:59,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:59,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-15 23:13:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:59,296 INFO L225 Difference]: With dead ends: 949 [2019-11-15 23:13:59,296 INFO L226 Difference]: Without dead ends: 480 [2019-11-15 23:13:59,297 INFO L600 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-15 23:13:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-15 23:13:59,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-11-15 23:13:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-15 23:13:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 749 transitions. [2019-11-15 23:13:59,320 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 749 transitions. Word has length 82 [2019-11-15 23:13:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:59,321 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 749 transitions. [2019-11-15 23:13:59,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 749 transitions. [2019-11-15 23:13:59,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 23:13:59,322 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:59,323 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2019-11-15 23:13:59,323 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:59,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:59,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1112997795, now seen corresponding path program 1 times [2019-11-15 23:13:59,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:59,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740885001] [2019-11-15 23:13:59,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:59,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:59,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:13:59,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740885001] [2019-11-15 23:13:59,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:59,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:59,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992259949] [2019-11-15 23:13:59,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:59,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:59,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:59,364 INFO L87 Difference]: Start difference. First operand 476 states and 749 transitions. Second operand 3 states. [2019-11-15 23:13:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:59,560 INFO L93 Difference]: Finished difference Result 997 states and 1572 transitions. [2019-11-15 23:13:59,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:59,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 23:13:59,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:59,563 INFO L225 Difference]: With dead ends: 997 [2019-11-15 23:13:59,564 INFO L226 Difference]: Without dead ends: 528 [2019-11-15 23:13:59,565 INFO L600 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-15 23:13:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-15 23:13:59,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-11-15 23:13:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-15 23:13:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 804 transitions. [2019-11-15 23:13:59,589 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 804 transitions. Word has length 83 [2019-11-15 23:13:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:59,590 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 804 transitions. [2019-11-15 23:13:59,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 804 transitions. [2019-11-15 23:13:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 23:13:59,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:59,592 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2019-11-15 23:13:59,592 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:59,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:59,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1939998609, now seen corresponding path program 1 times [2019-11-15 23:13:59,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:59,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707461840] [2019-11-15 23:13:59,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:59,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:59,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:13:59,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707461840] [2019-11-15 23:13:59,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:59,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:59,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906160696] [2019-11-15 23:13:59,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:59,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:59,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:59,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:59,640 INFO L87 Difference]: Start difference. First operand 512 states and 804 transitions. Second operand 3 states. [2019-11-15 23:13:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:59,882 INFO L93 Difference]: Finished difference Result 1033 states and 1623 transitions. [2019-11-15 23:13:59,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:13:59,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 23:13:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:59,887 INFO L225 Difference]: With dead ends: 1033 [2019-11-15 23:13:59,887 INFO L226 Difference]: Without dead ends: 528 [2019-11-15 23:13:59,888 INFO L600 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-15 23:13:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-15 23:13:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-11-15 23:13:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-15 23:13:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 800 transitions. [2019-11-15 23:13:59,919 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 800 transitions. Word has length 84 [2019-11-15 23:13:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:59,920 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 800 transitions. [2019-11-15 23:13:59,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:13:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 800 transitions. [2019-11-15 23:13:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 23:13:59,922 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:13:59,922 INFO L380 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, 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-15 23:13:59,922 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:13:59,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:13:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1409112293, now seen corresponding path program 1 times [2019-11-15 23:13:59,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:13:59,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156593157] [2019-11-15 23:13:59,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:59,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:13:59,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:13:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:13:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:13:59,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156593157] [2019-11-15 23:13:59,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:13:59,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:13:59,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362804569] [2019-11-15 23:13:59,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:13:59,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:13:59,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:13:59,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:13:59,983 INFO L87 Difference]: Start difference. First operand 512 states and 800 transitions. Second operand 3 states. [2019-11-15 23:14:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:00,228 INFO L93 Difference]: Finished difference Result 1078 states and 1682 transitions. [2019-11-15 23:14:00,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:00,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 23:14:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:00,233 INFO L225 Difference]: With dead ends: 1078 [2019-11-15 23:14:00,233 INFO L226 Difference]: Without dead ends: 573 [2019-11-15 23:14:00,235 INFO L600 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-15 23:14:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-11-15 23:14:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 565. [2019-11-15 23:14:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-11-15 23:14:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 881 transitions. [2019-11-15 23:14:00,263 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 881 transitions. Word has length 84 [2019-11-15 23:14:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:00,264 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 881 transitions. [2019-11-15 23:14:00,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 881 transitions. [2019-11-15 23:14:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:14:00,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:00,266 INFO L380 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:00,266 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1919478498, now seen corresponding path program 1 times [2019-11-15 23:14:00,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:00,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121442165] [2019-11-15 23:14:00,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:00,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:00,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:14:00,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121442165] [2019-11-15 23:14:00,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:00,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:14:00,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991691330] [2019-11-15 23:14:00,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:00,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:00,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:00,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:00,320 INFO L87 Difference]: Start difference. First operand 565 states and 881 transitions. Second operand 3 states. [2019-11-15 23:14:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:00,531 INFO L93 Difference]: Finished difference Result 1131 states and 1761 transitions. [2019-11-15 23:14:00,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:00,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-15 23:14:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:00,535 INFO L225 Difference]: With dead ends: 1131 [2019-11-15 23:14:00,535 INFO L226 Difference]: Without dead ends: 571 [2019-11-15 23:14:00,537 INFO L600 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-15 23:14:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-15 23:14:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 563. [2019-11-15 23:14:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-15 23:14:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 876 transitions. [2019-11-15 23:14:00,563 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 876 transitions. Word has length 85 [2019-11-15 23:14:00,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:00,564 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 876 transitions. [2019-11-15 23:14:00,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 876 transitions. [2019-11-15 23:14:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 23:14:00,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:00,566 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 23:14:00,566 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:00,566 INFO L82 PathProgramCache]: Analyzing trace with hash -818800783, now seen corresponding path program 1 times [2019-11-15 23:14:00,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:00,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559584652] [2019-11-15 23:14:00,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:00,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:00,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 23:14:00,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559584652] [2019-11-15 23:14:00,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:00,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:14:00,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898287330] [2019-11-15 23:14:00,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:00,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:00,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:00,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:00,598 INFO L87 Difference]: Start difference. First operand 563 states and 876 transitions. Second operand 3 states. [2019-11-15 23:14:00,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:00,756 INFO L93 Difference]: Finished difference Result 1159 states and 1804 transitions. [2019-11-15 23:14:00,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:00,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-15 23:14:00,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:00,760 INFO L225 Difference]: With dead ends: 1159 [2019-11-15 23:14:00,761 INFO L226 Difference]: Without dead ends: 603 [2019-11-15 23:14:00,762 INFO L600 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-15 23:14:00,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-15 23:14:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-11-15 23:14:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-15 23:14:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 917 transitions. [2019-11-15 23:14:00,787 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 917 transitions. Word has length 106 [2019-11-15 23:14:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:00,787 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 917 transitions. [2019-11-15 23:14:00,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 917 transitions. [2019-11-15 23:14:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-15 23:14:00,789 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:00,789 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 23:14:00,790 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:00,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1053492997, now seen corresponding path program 1 times [2019-11-15 23:14:00,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:00,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381173023] [2019-11-15 23:14:00,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:00,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:00,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 23:14:00,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381173023] [2019-11-15 23:14:00,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:00,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:14:00,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179173502] [2019-11-15 23:14:00,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:00,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:00,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:00,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:00,823 INFO L87 Difference]: Start difference. First operand 593 states and 917 transitions. Second operand 3 states. [2019-11-15 23:14:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:00,997 INFO L93 Difference]: Finished difference Result 1189 states and 1839 transitions. [2019-11-15 23:14:00,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:00,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-15 23:14:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:01,002 INFO L225 Difference]: With dead ends: 1189 [2019-11-15 23:14:01,002 INFO L226 Difference]: Without dead ends: 603 [2019-11-15 23:14:01,003 INFO L600 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-15 23:14:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-15 23:14:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-11-15 23:14:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-15 23:14:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 911 transitions. [2019-11-15 23:14:01,032 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 911 transitions. Word has length 107 [2019-11-15 23:14:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:01,033 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 911 transitions. [2019-11-15 23:14:01,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 911 transitions. [2019-11-15 23:14:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-15 23:14:01,035 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:01,036 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:01,036 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash 532417498, now seen corresponding path program 1 times [2019-11-15 23:14:01,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:01,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545799400] [2019-11-15 23:14:01,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:01,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:01,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-15 23:14:01,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545799400] [2019-11-15 23:14:01,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:01,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:14:01,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785147531] [2019-11-15 23:14:01,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:01,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:01,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:01,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:01,077 INFO L87 Difference]: Start difference. First operand 593 states and 911 transitions. Second operand 3 states. [2019-11-15 23:14:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:01,268 INFO L93 Difference]: Finished difference Result 1239 states and 1906 transitions. [2019-11-15 23:14:01,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:01,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-15 23:14:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:01,274 INFO L225 Difference]: With dead ends: 1239 [2019-11-15 23:14:01,274 INFO L226 Difference]: Without dead ends: 653 [2019-11-15 23:14:01,275 INFO L600 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-15 23:14:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-11-15 23:14:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-11-15 23:14:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-15 23:14:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 958 transitions. [2019-11-15 23:14:01,304 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 958 transitions. Word has length 110 [2019-11-15 23:14:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:01,305 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 958 transitions. [2019-11-15 23:14:01,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 958 transitions. [2019-11-15 23:14:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-15 23:14:01,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:01,307 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 23:14:01,308 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:01,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:01,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1562226642, now seen corresponding path program 1 times [2019-11-15 23:14:01,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:01,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979213487] [2019-11-15 23:14:01,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:01,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:01,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-15 23:14:01,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979213487] [2019-11-15 23:14:01,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:01,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:14:01,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439158761] [2019-11-15 23:14:01,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:01,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:01,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:01,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:01,345 INFO L87 Difference]: Start difference. First operand 627 states and 958 transitions. Second operand 3 states. [2019-11-15 23:14:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:01,545 INFO L93 Difference]: Finished difference Result 1273 states and 1947 transitions. [2019-11-15 23:14:01,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:01,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-15 23:14:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:01,550 INFO L225 Difference]: With dead ends: 1273 [2019-11-15 23:14:01,550 INFO L226 Difference]: Without dead ends: 653 [2019-11-15 23:14:01,551 INFO L600 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-15 23:14:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-11-15 23:14:01,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-11-15 23:14:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-15 23:14:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 952 transitions. [2019-11-15 23:14:01,577 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 952 transitions. Word has length 111 [2019-11-15 23:14:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:01,577 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 952 transitions. [2019-11-15 23:14:01,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 952 transitions. [2019-11-15 23:14:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 23:14:01,579 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:01,579 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2019-11-15 23:14:01,580 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:01,580 INFO L82 PathProgramCache]: Analyzing trace with hash 2031768980, now seen corresponding path program 1 times [2019-11-15 23:14:01,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:01,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209925994] [2019-11-15 23:14:01,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:01,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:01,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 23:14:01,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209925994] [2019-11-15 23:14:01,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:01,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:14:01,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671074530] [2019-11-15 23:14:01,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:01,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:01,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:01,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:01,624 INFO L87 Difference]: Start difference. First operand 627 states and 952 transitions. Second operand 3 states. [2019-11-15 23:14:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:01,822 INFO L93 Difference]: Finished difference Result 1300 states and 1972 transitions. [2019-11-15 23:14:01,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:01,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-15 23:14:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:01,829 INFO L225 Difference]: With dead ends: 1300 [2019-11-15 23:14:01,829 INFO L226 Difference]: Without dead ends: 680 [2019-11-15 23:14:01,831 INFO L600 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-15 23:14:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-11-15 23:14:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 674. [2019-11-15 23:14:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-15 23:14:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1020 transitions. [2019-11-15 23:14:01,867 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1020 transitions. Word has length 122 [2019-11-15 23:14:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:01,867 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 1020 transitions. [2019-11-15 23:14:01,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1020 transitions. [2019-11-15 23:14:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 23:14:01,870 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:01,870 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:01,871 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:01,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:01,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1706022811, now seen corresponding path program 1 times [2019-11-15 23:14:01,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:01,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852280178] [2019-11-15 23:14:01,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:01,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:01,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 23:14:01,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852280178] [2019-11-15 23:14:01,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:01,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:14:01,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291536028] [2019-11-15 23:14:01,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:01,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:01,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:01,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:01,943 INFO L87 Difference]: Start difference. First operand 674 states and 1020 transitions. Second operand 3 states. [2019-11-15 23:14:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:02,044 INFO L93 Difference]: Finished difference Result 1343 states and 2030 transitions. [2019-11-15 23:14:02,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:02,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-15 23:14:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:02,052 INFO L225 Difference]: With dead ends: 1343 [2019-11-15 23:14:02,053 INFO L226 Difference]: Without dead ends: 1341 [2019-11-15 23:14:02,053 INFO L600 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-15 23:14:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-11-15 23:14:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2019-11-15 23:14:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-11-15 23:14:02,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2026 transitions. [2019-11-15 23:14:02,109 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2026 transitions. Word has length 123 [2019-11-15 23:14:02,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:02,109 INFO L462 AbstractCegarLoop]: Abstraction has 1339 states and 2026 transitions. [2019-11-15 23:14:02,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2026 transitions. [2019-11-15 23:14:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-15 23:14:02,113 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:02,113 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:02,113 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:02,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:02,114 INFO L82 PathProgramCache]: Analyzing trace with hash 601196500, now seen corresponding path program 1 times [2019-11-15 23:14:02,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:02,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452512029] [2019-11-15 23:14:02,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:02,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:02,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 23:14:02,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452512029] [2019-11-15 23:14:02,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:02,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:14:02,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675102380] [2019-11-15 23:14:02,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:02,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:02,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:02,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:02,157 INFO L87 Difference]: Start difference. First operand 1339 states and 2026 transitions. Second operand 3 states. [2019-11-15 23:14:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:02,234 INFO L93 Difference]: Finished difference Result 3328 states and 5034 transitions. [2019-11-15 23:14:02,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:02,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-15 23:14:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:02,247 INFO L225 Difference]: With dead ends: 3328 [2019-11-15 23:14:02,247 INFO L226 Difference]: Without dead ends: 1996 [2019-11-15 23:14:02,249 INFO L600 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-15 23:14:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-11-15 23:14:02,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1994. [2019-11-15 23:14:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-11-15 23:14:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 3012 transitions. [2019-11-15 23:14:02,333 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 3012 transitions. Word has length 124 [2019-11-15 23:14:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:02,334 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 3012 transitions. [2019-11-15 23:14:02,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 3012 transitions. [2019-11-15 23:14:02,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-15 23:14:02,337 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:02,338 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:02,338 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:02,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:02,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1540663978, now seen corresponding path program 1 times [2019-11-15 23:14:02,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:02,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804690775] [2019-11-15 23:14:02,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:02,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:02,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-15 23:14:02,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804690775] [2019-11-15 23:14:02,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:02,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:14:02,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984459094] [2019-11-15 23:14:02,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:02,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:02,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:02,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:02,377 INFO L87 Difference]: Start difference. First operand 1994 states and 3012 transitions. Second operand 3 states. [2019-11-15 23:14:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:02,498 INFO L93 Difference]: Finished difference Result 4616 states and 6971 transitions. [2019-11-15 23:14:02,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:02,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-15 23:14:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:02,515 INFO L225 Difference]: With dead ends: 4616 [2019-11-15 23:14:02,516 INFO L226 Difference]: Without dead ends: 2629 [2019-11-15 23:14:02,519 INFO L600 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-15 23:14:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-11-15 23:14:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2627. [2019-11-15 23:14:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2627 states. [2019-11-15 23:14:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3961 transitions. [2019-11-15 23:14:02,642 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3961 transitions. Word has length 124 [2019-11-15 23:14:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:02,643 INFO L462 AbstractCegarLoop]: Abstraction has 2627 states and 3961 transitions. [2019-11-15 23:14:02,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3961 transitions. [2019-11-15 23:14:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-15 23:14:02,648 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:02,648 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:02,648 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:02,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:02,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1091794830, now seen corresponding path program 1 times [2019-11-15 23:14:02,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:02,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421229157] [2019-11-15 23:14:02,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:02,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:02,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-15 23:14:02,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421229157] [2019-11-15 23:14:02,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:02,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:14:02,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311862036] [2019-11-15 23:14:02,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:02,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:02,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:02,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:02,698 INFO L87 Difference]: Start difference. First operand 2627 states and 3961 transitions. Second operand 3 states. [2019-11-15 23:14:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:02,981 INFO L93 Difference]: Finished difference Result 5375 states and 8098 transitions. [2019-11-15 23:14:02,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:02,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-15 23:14:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:02,998 INFO L225 Difference]: With dead ends: 5375 [2019-11-15 23:14:02,999 INFO L226 Difference]: Without dead ends: 2755 [2019-11-15 23:14:03,004 INFO L600 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-15 23:14:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-15 23:14:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-11-15 23:14:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-15 23:14:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4076 transitions. [2019-11-15 23:14:03,133 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4076 transitions. Word has length 132 [2019-11-15 23:14:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:03,133 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4076 transitions. [2019-11-15 23:14:03,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4076 transitions. [2019-11-15 23:14:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-15 23:14:03,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:03,139 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:03,139 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash -106917274, now seen corresponding path program 1 times [2019-11-15 23:14:03,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:03,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315180958] [2019-11-15 23:14:03,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:03,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:03,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-15 23:14:03,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315180958] [2019-11-15 23:14:03,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:03,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:14:03,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455833735] [2019-11-15 23:14:03,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:03,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:03,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:03,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:03,183 INFO L87 Difference]: Start difference. First operand 2723 states and 4076 transitions. Second operand 3 states. [2019-11-15 23:14:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:03,450 INFO L93 Difference]: Finished difference Result 5471 states and 8181 transitions. [2019-11-15 23:14:03,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:03,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-15 23:14:03,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:03,466 INFO L225 Difference]: With dead ends: 5471 [2019-11-15 23:14:03,467 INFO L226 Difference]: Without dead ends: 2755 [2019-11-15 23:14:03,471 INFO L600 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-15 23:14:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-15 23:14:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-11-15 23:14:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-15 23:14:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4044 transitions. [2019-11-15 23:14:03,650 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4044 transitions. Word has length 133 [2019-11-15 23:14:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:03,651 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4044 transitions. [2019-11-15 23:14:03,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4044 transitions. [2019-11-15 23:14:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-15 23:14:03,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:03,656 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-15 23:14:03,656 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:03,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2091342634, now seen corresponding path program 1 times [2019-11-15 23:14:03,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:03,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918909772] [2019-11-15 23:14:03,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:03,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:03,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-15 23:14:03,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918909772] [2019-11-15 23:14:03,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:03,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:14:03,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216773173] [2019-11-15 23:14:03,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:03,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:03,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:03,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:03,709 INFO L87 Difference]: Start difference. First operand 2723 states and 4044 transitions. Second operand 3 states. [2019-11-15 23:14:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:04,019 INFO L93 Difference]: Finished difference Result 5521 states and 8174 transitions. [2019-11-15 23:14:04,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:04,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-15 23:14:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:04,036 INFO L225 Difference]: With dead ends: 5521 [2019-11-15 23:14:04,036 INFO L226 Difference]: Without dead ends: 2805 [2019-11-15 23:14:04,040 INFO L600 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-15 23:14:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2019-11-15 23:14:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2723. [2019-11-15 23:14:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-15 23:14:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3956 transitions. [2019-11-15 23:14:04,153 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3956 transitions. Word has length 163 [2019-11-15 23:14:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:04,153 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 3956 transitions. [2019-11-15 23:14:04,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3956 transitions. [2019-11-15 23:14:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-15 23:14:04,158 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:04,158 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:04,159 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:04,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1144304748, now seen corresponding path program 1 times [2019-11-15 23:14:04,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:04,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942412480] [2019-11-15 23:14:04,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:04,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:04,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-15 23:14:04,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942412480] [2019-11-15 23:14:04,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:14:04,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:14:04,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96075946] [2019-11-15 23:14:04,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:04,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:04,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:04,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:14:04,214 INFO L87 Difference]: Start difference. First operand 2723 states and 3956 transitions. Second operand 3 states. [2019-11-15 23:14:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:04,533 INFO L93 Difference]: Finished difference Result 5711 states and 8273 transitions. [2019-11-15 23:14:04,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:04,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-15 23:14:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:04,561 INFO L225 Difference]: With dead ends: 5711 [2019-11-15 23:14:04,570 INFO L226 Difference]: Without dead ends: 2995 [2019-11-15 23:14:04,574 INFO L600 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-15 23:14:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-11-15 23:14:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2839. [2019-11-15 23:14:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2839 states. [2019-11-15 23:14:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 4044 transitions. [2019-11-15 23:14:04,694 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 4044 transitions. Word has length 163 [2019-11-15 23:14:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:04,694 INFO L462 AbstractCegarLoop]: Abstraction has 2839 states and 4044 transitions. [2019-11-15 23:14:04,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 4044 transitions. [2019-11-15 23:14:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-15 23:14:04,699 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:04,700 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:04,700 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1925800112, now seen corresponding path program 1 times [2019-11-15 23:14:04,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:04,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839497622] [2019-11-15 23:14:04,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:04,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:04,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:14:04,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839497622] [2019-11-15 23:14:04,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463153588] [2019-11-15 23:14:04,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:04,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:14:04,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-15 23:14:05,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:05,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:14:05,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476798695] [2019-11-15 23:14:05,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:05,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:05,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:05,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:05,034 INFO L87 Difference]: Start difference. First operand 2839 states and 4044 transitions. Second operand 3 states. [2019-11-15 23:14:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:05,280 INFO L93 Difference]: Finished difference Result 8484 states and 12071 transitions. [2019-11-15 23:14:05,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:05,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-15 23:14:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:05,314 INFO L225 Difference]: With dead ends: 8484 [2019-11-15 23:14:05,319 INFO L226 Difference]: Without dead ends: 5652 [2019-11-15 23:14:05,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2019-11-15 23:14:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 5650. [2019-11-15 23:14:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5650 states. [2019-11-15 23:14:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 8033 transitions. [2019-11-15 23:14:05,668 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 8033 transitions. Word has length 171 [2019-11-15 23:14:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:05,668 INFO L462 AbstractCegarLoop]: Abstraction has 5650 states and 8033 transitions. [2019-11-15 23:14:05,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 8033 transitions. [2019-11-15 23:14:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-15 23:14:05,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:05,678 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:05,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:05,892 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:05,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1741886925, now seen corresponding path program 1 times [2019-11-15 23:14:05,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:05,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215708119] [2019-11-15 23:14:05,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:05,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:05,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:14:05,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215708119] [2019-11-15 23:14:05,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842349322] [2019-11-15 23:14:05,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:06,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:14:06,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-15 23:14:06,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:06,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:14:06,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680351182] [2019-11-15 23:14:06,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:06,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:06,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:06,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:06,157 INFO L87 Difference]: Start difference. First operand 5650 states and 8033 transitions. Second operand 3 states. [2019-11-15 23:14:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:06,599 INFO L93 Difference]: Finished difference Result 11836 states and 16798 transitions. [2019-11-15 23:14:06,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:06,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-15 23:14:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:06,614 INFO L225 Difference]: With dead ends: 11836 [2019-11-15 23:14:06,614 INFO L226 Difference]: Without dead ends: 5994 [2019-11-15 23:14:06,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2019-11-15 23:14:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 5834. [2019-11-15 23:14:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5834 states. [2019-11-15 23:14:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 8265 transitions. [2019-11-15 23:14:06,893 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 8265 transitions. Word has length 172 [2019-11-15 23:14:06,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:06,893 INFO L462 AbstractCegarLoop]: Abstraction has 5834 states and 8265 transitions. [2019-11-15 23:14:06,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 8265 transitions. [2019-11-15 23:14:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 23:14:06,904 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:06,904 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:07,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:07,117 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:07,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:07,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1648497422, now seen corresponding path program 1 times [2019-11-15 23:14:07,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:07,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953991329] [2019-11-15 23:14:07,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:07,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:07,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 130 proven. 6 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:14:07,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953991329] [2019-11-15 23:14:07,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520308586] [2019-11-15 23:14:07,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:07,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:14:07,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-11-15 23:14:07,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:07,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:14:07,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487519341] [2019-11-15 23:14:07,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:07,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:07,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:07,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:07,402 INFO L87 Difference]: Start difference. First operand 5834 states and 8265 transitions. Second operand 3 states. [2019-11-15 23:14:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:07,862 INFO L93 Difference]: Finished difference Result 10593 states and 14957 transitions. [2019-11-15 23:14:07,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:07,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-15 23:14:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:07,875 INFO L225 Difference]: With dead ends: 10593 [2019-11-15 23:14:07,875 INFO L226 Difference]: Without dead ends: 4615 [2019-11-15 23:14:07,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4615 states. [2019-11-15 23:14:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4615 to 4471. [2019-11-15 23:14:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-15 23:14:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6324 transitions. [2019-11-15 23:14:08,070 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6324 transitions. Word has length 173 [2019-11-15 23:14:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:08,071 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6324 transitions. [2019-11-15 23:14:08,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6324 transitions. [2019-11-15 23:14:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-15 23:14:08,079 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:08,083 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:08,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:08,296 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:08,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:08,296 INFO L82 PathProgramCache]: Analyzing trace with hash 492657149, now seen corresponding path program 1 times [2019-11-15 23:14:08,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:08,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464269929] [2019-11-15 23:14:08,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:08,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:08,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-15 23:14:08,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464269929] [2019-11-15 23:14:08,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109296790] [2019-11-15 23:14:08,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:08,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:14:08,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:08,578 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-11-15 23:14:08,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:08,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-15 23:14:08,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976963620] [2019-11-15 23:14:08,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:08,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:08,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:08,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:14:08,581 INFO L87 Difference]: Start difference. First operand 4471 states and 6324 transitions. Second operand 3 states. [2019-11-15 23:14:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:08,750 INFO L93 Difference]: Finished difference Result 8870 states and 12551 transitions. [2019-11-15 23:14:08,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:08,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-15 23:14:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:08,761 INFO L225 Difference]: With dead ends: 8870 [2019-11-15 23:14:08,762 INFO L226 Difference]: Without dead ends: 4473 [2019-11-15 23:14:08,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:14:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2019-11-15 23:14:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4471. [2019-11-15 23:14:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-15 23:14:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6308 transitions. [2019-11-15 23:14:08,949 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6308 transitions. Word has length 176 [2019-11-15 23:14:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:08,950 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6308 transitions. [2019-11-15 23:14:08,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6308 transitions. [2019-11-15 23:14:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-15 23:14:08,958 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:08,959 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:09,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:09,165 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:09,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:09,165 INFO L82 PathProgramCache]: Analyzing trace with hash 750822587, now seen corresponding path program 1 times [2019-11-15 23:14:09,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:09,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049936478] [2019-11-15 23:14:09,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:09,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:09,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-15 23:14:09,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049936478] [2019-11-15 23:14:09,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077797754] [2019-11-15 23:14:09,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:09,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:14:09,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-11-15 23:14:09,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:09,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-15 23:14:09,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782239157] [2019-11-15 23:14:09,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:09,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:09,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:09,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:14:09,431 INFO L87 Difference]: Start difference. First operand 4471 states and 6308 transitions. Second operand 3 states. [2019-11-15 23:14:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:09,784 INFO L93 Difference]: Finished difference Result 7803 states and 10977 transitions. [2019-11-15 23:14:09,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:09,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-15 23:14:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:09,793 INFO L225 Difference]: With dead ends: 7803 [2019-11-15 23:14:09,793 INFO L226 Difference]: Without dead ends: 3298 [2019-11-15 23:14:09,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:14:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-11-15 23:14:09,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3178. [2019-11-15 23:14:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-11-15 23:14:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4467 transitions. [2019-11-15 23:14:09,961 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4467 transitions. Word has length 176 [2019-11-15 23:14:09,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:09,961 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4467 transitions. [2019-11-15 23:14:09,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4467 transitions. [2019-11-15 23:14:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-15 23:14:09,971 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:09,972 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:10,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:10,187 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:10,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:10,187 INFO L82 PathProgramCache]: Analyzing trace with hash 290208357, now seen corresponding path program 2 times [2019-11-15 23:14:10,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:10,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556764023] [2019-11-15 23:14:10,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:10,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:10,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 191 proven. 19 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:14:10,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556764023] [2019-11-15 23:14:10,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308854387] [2019-11-15 23:14:10,310 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:10,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-15 23:14:10,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:14:10,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:14:10,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-11-15 23:14:10,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:10,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:14:10,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099248733] [2019-11-15 23:14:10,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:10,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:10,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:10,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:10,450 INFO L87 Difference]: Start difference. First operand 3178 states and 4467 transitions. Second operand 3 states. [2019-11-15 23:14:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:10,808 INFO L93 Difference]: Finished difference Result 6414 states and 9030 transitions. [2019-11-15 23:14:10,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:10,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-15 23:14:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:10,816 INFO L225 Difference]: With dead ends: 6414 [2019-11-15 23:14:10,816 INFO L226 Difference]: Without dead ends: 3362 [2019-11-15 23:14:10,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:10,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2019-11-15 23:14:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3178. [2019-11-15 23:14:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-11-15 23:14:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4451 transitions. [2019-11-15 23:14:10,939 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4451 transitions. Word has length 181 [2019-11-15 23:14:10,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:10,940 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4451 transitions. [2019-11-15 23:14:10,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4451 transitions. [2019-11-15 23:14:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 23:14:10,946 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:10,946 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:11,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:11,150 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:11,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1359170395, now seen corresponding path program 1 times [2019-11-15 23:14:11,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:11,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393571064] [2019-11-15 23:14:11,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:11,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:11,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:14:11,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393571064] [2019-11-15 23:14:11,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427312025] [2019-11-15 23:14:11,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:11,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:14:11,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-15 23:14:11,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:11,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:14:11,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492307548] [2019-11-15 23:14:11,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:11,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:11,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:11,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:11,408 INFO L87 Difference]: Start difference. First operand 3178 states and 4451 transitions. Second operand 3 states. [2019-11-15 23:14:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:11,620 INFO L93 Difference]: Finished difference Result 9098 states and 12761 transitions. [2019-11-15 23:14:11,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:11,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-15 23:14:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:11,635 INFO L225 Difference]: With dead ends: 9098 [2019-11-15 23:14:11,635 INFO L226 Difference]: Without dead ends: 6110 [2019-11-15 23:14:11,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2019-11-15 23:14:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 6108. [2019-11-15 23:14:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2019-11-15 23:14:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 8553 transitions. [2019-11-15 23:14:11,877 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 8553 transitions. Word has length 183 [2019-11-15 23:14:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:11,878 INFO L462 AbstractCegarLoop]: Abstraction has 6108 states and 8553 transitions. [2019-11-15 23:14:11,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 8553 transitions. [2019-11-15 23:14:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 23:14:11,889 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:11,889 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:12,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:12,093 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:12,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash -580968611, now seen corresponding path program 1 times [2019-11-15 23:14:12,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:12,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950046204] [2019-11-15 23:14:12,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:12,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:12,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:14:12,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950046204] [2019-11-15 23:14:12,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964892531] [2019-11-15 23:14:12,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:12,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:14:12,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-15 23:14:12,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:12,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:14:12,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517639377] [2019-11-15 23:14:12,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:12,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:12,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:12,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:12,342 INFO L87 Difference]: Start difference. First operand 6108 states and 8553 transitions. Second operand 3 states. [2019-11-15 23:14:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:12,640 INFO L93 Difference]: Finished difference Result 12076 states and 16919 transitions. [2019-11-15 23:14:12,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:12,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-15 23:14:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:12,661 INFO L225 Difference]: With dead ends: 12076 [2019-11-15 23:14:12,662 INFO L226 Difference]: Without dead ends: 9088 [2019-11-15 23:14:12,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2019-11-15 23:14:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9086. [2019-11-15 23:14:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9086 states. [2019-11-15 23:14:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 12719 transitions. [2019-11-15 23:14:13,178 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 12719 transitions. Word has length 185 [2019-11-15 23:14:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:13,178 INFO L462 AbstractCegarLoop]: Abstraction has 9086 states and 12719 transitions. [2019-11-15 23:14:13,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 12719 transitions. [2019-11-15 23:14:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 23:14:13,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:13,192 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:13,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:13,398 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:13,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:13,398 INFO L82 PathProgramCache]: Analyzing trace with hash -607881575, now seen corresponding path program 1 times [2019-11-15 23:14:13,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:13,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303597478] [2019-11-15 23:14:13,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:13,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:13,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 197 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:14:13,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303597478] [2019-11-15 23:14:13,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255221100] [2019-11-15 23:14:13,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:13,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:14:13,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-15 23:14:13,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:13,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:14:13,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441365229] [2019-11-15 23:14:13,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:13,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:13,664 INFO L87 Difference]: Start difference. First operand 9086 states and 12719 transitions. Second operand 3 states. [2019-11-15 23:14:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:14,168 INFO L93 Difference]: Finished difference Result 20674 states and 28969 transitions. [2019-11-15 23:14:14,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:14,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-15 23:14:14,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:14,204 INFO L225 Difference]: With dead ends: 20674 [2019-11-15 23:14:14,205 INFO L226 Difference]: Without dead ends: 14708 [2019-11-15 23:14:14,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14708 states. [2019-11-15 23:14:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14708 to 14706. [2019-11-15 23:14:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-15 23:14:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20587 transitions. [2019-11-15 23:14:14,764 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20587 transitions. Word has length 186 [2019-11-15 23:14:14,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:14,764 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20587 transitions. [2019-11-15 23:14:14,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20587 transitions. [2019-11-15 23:14:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 23:14:14,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:14,779 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:14,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:14,984 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:14,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 9813042, now seen corresponding path program 3 times [2019-11-15 23:14:14,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:14,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381869921] [2019-11-15 23:14:14,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:14,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:14,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 198 proven. 21 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:14:15,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381869921] [2019-11-15 23:14:15,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267491117] [2019-11-15 23:14:15,070 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:15,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-11-15 23:14:15,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:14:15,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:14:15,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:15,208 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-11-15 23:14:15,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:15,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:14:15,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593069847] [2019-11-15 23:14:15,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:15,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:15,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:15,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:15,211 INFO L87 Difference]: Start difference. First operand 14706 states and 20587 transitions. Second operand 3 states. [2019-11-15 23:14:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:16,330 INFO L93 Difference]: Finished difference Result 30070 states and 42014 transitions. [2019-11-15 23:14:16,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:16,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-15 23:14:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:16,363 INFO L225 Difference]: With dead ends: 30070 [2019-11-15 23:14:16,364 INFO L226 Difference]: Without dead ends: 15314 [2019-11-15 23:14:16,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2019-11-15 23:14:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 14706. [2019-11-15 23:14:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-15 23:14:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20547 transitions. [2019-11-15 23:14:16,956 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20547 transitions. Word has length 186 [2019-11-15 23:14:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:16,956 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20547 transitions. [2019-11-15 23:14:16,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20547 transitions. [2019-11-15 23:14:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-15 23:14:16,969 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:16,969 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:17,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:17,173 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:17,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:17,173 INFO L82 PathProgramCache]: Analyzing trace with hash 854141729, now seen corresponding path program 1 times [2019-11-15 23:14:17,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:17,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696417152] [2019-11-15 23:14:17,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:17,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:17,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 198 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:14:17,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696417152] [2019-11-15 23:14:17,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548596248] [2019-11-15 23:14:17,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:17,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:14:17,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-11-15 23:14:17,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:14:17,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:14:17,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519561771] [2019-11-15 23:14:17,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:14:17,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:17,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:14:17,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:17,424 INFO L87 Difference]: Start difference. First operand 14706 states and 20547 transitions. Second operand 3 states. [2019-11-15 23:14:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:18,107 INFO L93 Difference]: Finished difference Result 29822 states and 41582 transitions. [2019-11-15 23:14:18,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:14:18,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-15 23:14:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:18,133 INFO L225 Difference]: With dead ends: 29822 [2019-11-15 23:14:18,133 INFO L226 Difference]: Without dead ends: 15186 [2019-11-15 23:14:18,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:14:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15186 states. [2019-11-15 23:14:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 14706. [2019-11-15 23:14:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-15 23:14:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20523 transitions. [2019-11-15 23:14:18,934 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20523 transitions. Word has length 187 [2019-11-15 23:14:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:18,934 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20523 transitions. [2019-11-15 23:14:18,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:14:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20523 transitions. [2019-11-15 23:14:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 23:14:18,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:18,941 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:19,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:19,144 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:19,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1508265096, now seen corresponding path program 4 times [2019-11-15 23:14:19,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:19,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41614056] [2019-11-15 23:14:19,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:19,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:19,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:14:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 196 proven. 27 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:14:19,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41614056] [2019-11-15 23:14:19,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2573379] [2019-11-15 23:14:19,216 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:19,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:14:19,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:14:19,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:14:19,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:14:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:14:19,385 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:14:19,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-15 23:14:19,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512042825] [2019-11-15 23:14:19,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:14:19,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:19,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:14:19,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:14:19,388 INFO L87 Difference]: Start difference. First operand 14706 states and 20523 transitions. Second operand 7 states. [2019-11-15 23:14:21,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:21,453 INFO L93 Difference]: Finished difference Result 50232 states and 68987 transitions. [2019-11-15 23:14:21,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:14:21,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 188 [2019-11-15 23:14:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:21,493 INFO L225 Difference]: With dead ends: 50232 [2019-11-15 23:14:21,493 INFO L226 Difference]: Without dead ends: 34696 [2019-11-15 23:14:21,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:14:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34696 states. [2019-11-15 23:14:22,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34696 to 17906. [2019-11-15 23:14:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17906 states. [2019-11-15 23:14:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17906 states to 17906 states and 24463 transitions. [2019-11-15 23:14:22,428 INFO L78 Accepts]: Start accepts. Automaton has 17906 states and 24463 transitions. Word has length 188 [2019-11-15 23:14:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:22,429 INFO L462 AbstractCegarLoop]: Abstraction has 17906 states and 24463 transitions. [2019-11-15 23:14:22,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:14:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 17906 states and 24463 transitions. [2019-11-15 23:14:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-15 23:14:22,438 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:14:22,439 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:14:22,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:22,653 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:14:22,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:14:22,653 INFO L82 PathProgramCache]: Analyzing trace with hash 941780496, now seen corresponding path program 1 times [2019-11-15 23:14:22,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:14:22,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266953124] [2019-11-15 23:14:22,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:22,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:14:22,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:14:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:14:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:14:22,884 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:14:22,884 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:14:23,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:14:23 BoogieIcfgContainer [2019-11-15 23:14:23,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:14:23,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:14:23,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:14:23,039 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:14:23,040 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:13:54" (3/4) ... [2019-11-15 23:14:23,042 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:14:23,250 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_457ec2d7-a2a2-4b48-9a7c-04182133b582/bin/uautomizer/witness.graphml [2019-11-15 23:14:23,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:14:23,253 INFO L168 Benchmark]: Toolchain (without parser) took 30373.45 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 946.2 MB in the beginning and 744.1 MB in the end (delta: 202.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-15 23:14:23,254 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:14:23,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:14:23,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:14:23,256 INFO L168 Benchmark]: Boogie Preprocessor took 47.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:14:23,256 INFO L168 Benchmark]: RCFGBuilder took 1188.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.3 MB). Peak memory consumption was 63.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:14:23,257 INFO L168 Benchmark]: TraceAbstraction took 28278.26 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 753.6 MB in the end (delta: 290.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-15 23:14:23,257 INFO L168 Benchmark]: Witness Printer took 212.28 ms. Allocated memory is still 2.3 GB. Free memory was 753.6 MB in the beginning and 744.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:14:23,263 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 552.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1188.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.3 MB). Peak memory consumption was 63.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28278.26 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 753.6 MB in the end (delta: 290.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 212.28 ms. Allocated memory is still 2.3 GB. Free memory was 753.6 MB in the beginning and 744.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L635] int s ; [L636] int tmp ; [L640] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 = __VERIFIER_nondet_int() ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 = __VERIFIER_nondet_ulong() ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L293] COND FALSE !(ret <= 0) [L296] COND FALSE !(\read(s__hit)) [L299] s__state = 8512 [L301] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND TRUE s__state == 8512 [L306] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L307] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L308] COND TRUE __cil_tmp56 + 256UL [L309] skip = 1 [L317] s__state = 8528 [L318] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND TRUE s__state == 8528 [L322] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L323] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L325] __cil_tmp57 = (unsigned long )s__options [L326] COND TRUE __cil_tmp57 + 2097152UL [L327] s__s3__tmp__use_rsa_tmp = 1 [L332] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L359] ret = __VERIFIER_nondet_int() [L360] COND FALSE !(ret <= 0) [L377] s__state = 8544 [L378] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND TRUE s__state == 8544 [L382] COND TRUE s__verify_mode + 1 [L383] COND FALSE !(s__session__peer != 0) [L394] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L395] __cil_tmp61 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L396] COND FALSE !(__cil_tmp61 + 256UL) [L406] s__s3__tmp__cert_request = 1 [L407] ret = __VERIFIER_nondet_int() [L408] COND FALSE !(ret <= 0) [L411] s__state = 8448 [L412] s__s3__tmp__next_state___0 = 8576 [L413] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND TRUE s__state == 8448 [L434] COND FALSE !(num1 > 0L) [L443] s__state = s__s3__tmp__next_state___0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND TRUE s__state == 8576 [L447] ret = __VERIFIER_nondet_int() [L448] COND FALSE !(ret <= 0) [L451] COND FALSE !(ret == 2) [L454] ret = __VERIFIER_nondet_int() [L455] COND FALSE !(ret <= 0) [L458] s__init_num = 0 [L459] s__state = 8592 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND TRUE state == 8576 [L603] COND TRUE s__state == 8592 [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE tmp___2 != -16384 [L606] COND TRUE __cil_tmp56 != 4294967040 [L607] COND TRUE __cil_tmp58 != 4294967294 [L608] COND TRUE tmp___7 != 1024 [L609] COND TRUE tmp___7 != 512 [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 28.2s, OverallIterations: 42, TraceHistogramMax: 7, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8062 SDtfs, 6835 SDslu, 4489 SDs, 0 SdLazy, 4523 SolverSat, 1377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2283 GetRequests, 2203 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17906occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.1s AutomataMinimizationTime, 41 MinimizatonAttempts, 19003 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 6893 NumberOfCodeBlocks, 6601 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 6649 ConstructedInterpolants, 0 QuantifiedInterpolants, 1685570 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3883 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 53 InterpolantComputations, 40 PerfectInterpolantSequences, 9886/10231 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...