./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.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_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/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 bb19220a89a4de9b41ceda2b5f420af7272fc928 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:26:27,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:26:27,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:26:27,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:26:27,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:26:27,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:26:27,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:26:27,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:26:27,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:26:27,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:26:27,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:26:27,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:26:27,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:26:27,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:26:27,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:26:27,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:26:27,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:26:27,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:26:27,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:26:27,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:26:27,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:26:27,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:26:27,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:26:27,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:26:27,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:26:27,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:26:27,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:26:27,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:26:27,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:26:27,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:26:27,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:26:27,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:26:27,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:26:27,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:26:27,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:26:27,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:26:27,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:26:27,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:26:27,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:26:27,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:26:27,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:26:27,605 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:26:27,631 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:26:27,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:26:27,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:26:27,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:26:27,638 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:26:27,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:26:27,638 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:26:27,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:26:27,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:26:27,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:26:27,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:26:27,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:26:27,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:26:27,640 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:26:27,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:26:27,640 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:26:27,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:26:27,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:26:27,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:26:27,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:26:27,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:26:27,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:26:27,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:26:27,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:26:27,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:26:27,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:26:27,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:26:27,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:26:27,643 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_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/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 -> bb19220a89a4de9b41ceda2b5f420af7272fc928 [2019-11-16 00:26:27,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:26:27,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:26:27,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:26:27,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:26:27,686 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:26:27,687 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2019-11-16 00:26:27,740 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/bin/uautomizer/data/05d5a9883/64f0cd629f21409b91be06b7e2dcca11/FLAGeac398303 [2019-11-16 00:26:28,137 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:26:28,138 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2019-11-16 00:26:28,150 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/bin/uautomizer/data/05d5a9883/64f0cd629f21409b91be06b7e2dcca11/FLAGeac398303 [2019-11-16 00:26:28,495 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/bin/uautomizer/data/05d5a9883/64f0cd629f21409b91be06b7e2dcca11 [2019-11-16 00:26:28,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:26:28,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:26:28,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:28,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:26:28,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:26:28,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:28" (1/1) ... [2019-11-16 00:26:28,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1abd6267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28, skipping insertion in model container [2019-11-16 00:26:28,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:28" (1/1) ... [2019-11-16 00:26:28,518 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:26:28,563 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:26:28,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:28,851 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:26:28,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:28,963 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:26:28,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28 WrapperNode [2019-11-16 00:26:28,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:28,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:26:28,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:26:28,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:26:28,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28" (1/1) ... [2019-11-16 00:26:28,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28" (1/1) ... [2019-11-16 00:26:29,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:26:29,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:26:29,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:26:29,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:26:29,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28" (1/1) ... [2019-11-16 00:26:29,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28" (1/1) ... [2019-11-16 00:26:29,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28" (1/1) ... [2019-11-16 00:26:29,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28" (1/1) ... [2019-11-16 00:26:29,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28" (1/1) ... [2019-11-16 00:26:29,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28" (1/1) ... [2019-11-16 00:26:29,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28" (1/1) ... [2019-11-16 00:26:29,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:26:29,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:26:29,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:26:29,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:26:29,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/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-16 00:26:29,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:26:29,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:26:29,248 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:26:29,818 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-16 00:26:29,818 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-16 00:26:29,819 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:26:29,819 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:26:29,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:29 BoogieIcfgContainer [2019-11-16 00:26:29,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:26:29,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:26:29,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:26:29,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:26:29,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:26:28" (1/3) ... [2019-11-16 00:26:29,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe11a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:29, skipping insertion in model container [2019-11-16 00:26:29,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:28" (2/3) ... [2019-11-16 00:26:29,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe11a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:29, skipping insertion in model container [2019-11-16 00:26:29,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:29" (3/3) ... [2019-11-16 00:26:29,828 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2019-11-16 00:26:29,837 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:26:29,844 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:26:29,855 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:26:29,878 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:26:29,879 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:26:29,879 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:26:29,879 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:26:29,879 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:26:29,879 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:26:29,879 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:26:29,880 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:26:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-16 00:26:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:26:29,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:29,904 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] [2019-11-16 00:26:29,906 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:29,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:29,912 INFO L82 PathProgramCache]: Analyzing trace with hash 511659491, now seen corresponding path program 1 times [2019-11-16 00:26:29,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:29,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047536936] [2019-11-16 00:26:29,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:29,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:29,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:30,091 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-16 00:26:30,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047536936] [2019-11-16 00:26:30,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:30,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:26:30,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619929555] [2019-11-16 00:26:30,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:30,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:30,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:30,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:30,113 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-11-16 00:26:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:30,327 INFO L93 Difference]: Finished difference Result 246 states and 422 transitions. [2019-11-16 00:26:30,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:30,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-16 00:26:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:30,342 INFO L225 Difference]: With dead ends: 246 [2019-11-16 00:26:30,343 INFO L226 Difference]: Without dead ends: 112 [2019-11-16 00:26:30,347 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-16 00:26:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-16 00:26:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-16 00:26:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-16 00:26:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2019-11-16 00:26:30,410 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 24 [2019-11-16 00:26:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:30,411 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2019-11-16 00:26:30,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2019-11-16 00:26:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:26:30,415 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:30,415 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:30,416 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:30,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1971493731, now seen corresponding path program 1 times [2019-11-16 00:26:30,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:30,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350690454] [2019-11-16 00:26:30,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:30,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:30,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:30,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350690454] [2019-11-16 00:26:30,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:30,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:30,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671020520] [2019-11-16 00:26:30,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:30,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:30,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:30,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:30,525 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand 3 states. [2019-11-16 00:26:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:30,719 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-16 00:26:30,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:30,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-16 00:26:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:30,721 INFO L225 Difference]: With dead ends: 232 [2019-11-16 00:26:30,721 INFO L226 Difference]: Without dead ends: 130 [2019-11-16 00:26:30,722 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-16 00:26:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-16 00:26:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-11-16 00:26:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-16 00:26:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 190 transitions. [2019-11-16 00:26:30,745 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 190 transitions. Word has length 36 [2019-11-16 00:26:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:30,745 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 190 transitions. [2019-11-16 00:26:30,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:30,746 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 190 transitions. [2019-11-16 00:26:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:26:30,760 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:30,761 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:26:30,761 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:30,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:30,761 INFO L82 PathProgramCache]: Analyzing trace with hash 441356492, now seen corresponding path program 1 times [2019-11-16 00:26:30,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:30,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833707186] [2019-11-16 00:26:30,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:30,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:30,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:26:30,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833707186] [2019-11-16 00:26:30,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:30,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:30,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278833172] [2019-11-16 00:26:30,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:30,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:30,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:30,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:30,875 INFO L87 Difference]: Start difference. First operand 127 states and 190 transitions. Second operand 3 states. [2019-11-16 00:26:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:31,036 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-16 00:26:31,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:31,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-16 00:26:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:31,039 INFO L225 Difference]: With dead ends: 265 [2019-11-16 00:26:31,039 INFO L226 Difference]: Without dead ends: 148 [2019-11-16 00:26:31,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-16 00:26:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-16 00:26:31,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-11-16 00:26:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-16 00:26:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2019-11-16 00:26:31,052 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 50 [2019-11-16 00:26:31,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:31,052 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2019-11-16 00:26:31,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:31,053 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2019-11-16 00:26:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:26:31,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:31,055 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-16 00:26:31,056 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:31,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:31,056 INFO L82 PathProgramCache]: Analyzing trace with hash -394489400, now seen corresponding path program 1 times [2019-11-16 00:26:31,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:31,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106485892] [2019-11-16 00:26:31,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:31,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:31,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:26:31,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106485892] [2019-11-16 00:26:31,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:31,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:31,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562080034] [2019-11-16 00:26:31,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:31,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:31,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:31,134 INFO L87 Difference]: Start difference. First operand 144 states and 212 transitions. Second operand 3 states. [2019-11-16 00:26:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:31,185 INFO L93 Difference]: Finished difference Result 410 states and 605 transitions. [2019-11-16 00:26:31,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:31,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-16 00:26:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:31,189 INFO L225 Difference]: With dead ends: 410 [2019-11-16 00:26:31,189 INFO L226 Difference]: Without dead ends: 276 [2019-11-16 00:26:31,191 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-16 00:26:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-16 00:26:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2019-11-16 00:26:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-16 00:26:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 405 transitions. [2019-11-16 00:26:31,218 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 405 transitions. Word has length 67 [2019-11-16 00:26:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:31,219 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 405 transitions. [2019-11-16 00:26:31,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 405 transitions. [2019-11-16 00:26:31,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:26:31,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:31,223 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-11-16 00:26:31,224 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:31,224 INFO L82 PathProgramCache]: Analyzing trace with hash 625494152, now seen corresponding path program 1 times [2019-11-16 00:26:31,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:31,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227287907] [2019-11-16 00:26:31,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:31,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:31,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-16 00:26:31,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227287907] [2019-11-16 00:26:31,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:31,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:31,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227782058] [2019-11-16 00:26:31,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:31,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:31,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:31,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:31,368 INFO L87 Difference]: Start difference. First operand 276 states and 405 transitions. Second operand 3 states. [2019-11-16 00:26:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:31,566 INFO L93 Difference]: Finished difference Result 590 states and 878 transitions. [2019-11-16 00:26:31,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:31,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-16 00:26:31,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:31,572 INFO L225 Difference]: With dead ends: 590 [2019-11-16 00:26:31,572 INFO L226 Difference]: Without dead ends: 324 [2019-11-16 00:26:31,573 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-16 00:26:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-16 00:26:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 318. [2019-11-16 00:26:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-16 00:26:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 457 transitions. [2019-11-16 00:26:31,593 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 457 transitions. Word has length 85 [2019-11-16 00:26:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:31,594 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 457 transitions. [2019-11-16 00:26:31,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 457 transitions. [2019-11-16 00:26:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-16 00:26:31,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:31,601 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 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] [2019-11-16 00:26:31,601 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:31,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:31,601 INFO L82 PathProgramCache]: Analyzing trace with hash 743834560, now seen corresponding path program 1 times [2019-11-16 00:26:31,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:31,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785631866] [2019-11-16 00:26:31,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:31,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:31,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-16 00:26:31,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785631866] [2019-11-16 00:26:31,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:31,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:31,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318625987] [2019-11-16 00:26:31,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:31,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:31,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:31,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:31,696 INFO L87 Difference]: Start difference. First operand 318 states and 457 transitions. Second operand 3 states. [2019-11-16 00:26:31,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:31,747 INFO L93 Difference]: Finished difference Result 473 states and 680 transitions. [2019-11-16 00:26:31,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:31,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-16 00:26:31,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:31,751 INFO L225 Difference]: With dead ends: 473 [2019-11-16 00:26:31,751 INFO L226 Difference]: Without dead ends: 471 [2019-11-16 00:26:31,751 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-16 00:26:31,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-11-16 00:26:31,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-11-16 00:26:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-11-16 00:26:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 678 transitions. [2019-11-16 00:26:31,782 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 678 transitions. Word has length 105 [2019-11-16 00:26:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:31,785 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 678 transitions. [2019-11-16 00:26:31,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:31,785 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 678 transitions. [2019-11-16 00:26:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-16 00:26:31,788 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:31,795 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2019-11-16 00:26:31,795 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1167688199, now seen corresponding path program 1 times [2019-11-16 00:26:31,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:31,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735351226] [2019-11-16 00:26:31,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:31,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:31,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-16 00:26:31,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735351226] [2019-11-16 00:26:31,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:31,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:31,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117787811] [2019-11-16 00:26:31,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:31,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:31,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:31,869 INFO L87 Difference]: Start difference. First operand 471 states and 678 transitions. Second operand 3 states. [2019-11-16 00:26:32,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:32,099 INFO L93 Difference]: Finished difference Result 1082 states and 1605 transitions. [2019-11-16 00:26:32,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:32,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-16 00:26:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:32,106 INFO L225 Difference]: With dead ends: 1082 [2019-11-16 00:26:32,106 INFO L226 Difference]: Without dead ends: 618 [2019-11-16 00:26:32,107 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-16 00:26:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-16 00:26:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 594. [2019-11-16 00:26:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-16 00:26:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 876 transitions. [2019-11-16 00:26:32,136 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 876 transitions. Word has length 123 [2019-11-16 00:26:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:32,137 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 876 transitions. [2019-11-16 00:26:32,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 876 transitions. [2019-11-16 00:26:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-16 00:26:32,140 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:32,141 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 7, 7, 5, 5, 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] [2019-11-16 00:26:32,141 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:32,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:32,142 INFO L82 PathProgramCache]: Analyzing trace with hash -266344288, now seen corresponding path program 1 times [2019-11-16 00:26:32,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:32,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938285] [2019-11-16 00:26:32,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:32,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:32,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-16 00:26:32,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938285] [2019-11-16 00:26:32,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:32,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:32,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678750289] [2019-11-16 00:26:32,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:32,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:32,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:32,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:32,299 INFO L87 Difference]: Start difference. First operand 594 states and 876 transitions. Second operand 3 states. [2019-11-16 00:26:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:32,497 INFO L93 Difference]: Finished difference Result 1456 states and 2204 transitions. [2019-11-16 00:26:32,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:32,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-16 00:26:32,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:32,505 INFO L225 Difference]: With dead ends: 1456 [2019-11-16 00:26:32,506 INFO L226 Difference]: Without dead ends: 821 [2019-11-16 00:26:32,507 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-16 00:26:32,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-11-16 00:26:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 783. [2019-11-16 00:26:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-11-16 00:26:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1128 transitions. [2019-11-16 00:26:32,532 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1128 transitions. Word has length 149 [2019-11-16 00:26:32,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:32,533 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1128 transitions. [2019-11-16 00:26:32,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1128 transitions. [2019-11-16 00:26:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-16 00:26:32,535 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:32,536 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 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, 1] [2019-11-16 00:26:32,536 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:32,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:32,536 INFO L82 PathProgramCache]: Analyzing trace with hash -466571119, now seen corresponding path program 1 times [2019-11-16 00:26:32,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:32,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759365192] [2019-11-16 00:26:32,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:32,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:32,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-16 00:26:32,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759365192] [2019-11-16 00:26:32,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:32,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:32,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200352230] [2019-11-16 00:26:32,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:32,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:32,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:32,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:32,619 INFO L87 Difference]: Start difference. First operand 783 states and 1128 transitions. Second operand 3 states. [2019-11-16 00:26:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:32,818 INFO L93 Difference]: Finished difference Result 1712 states and 2481 transitions. [2019-11-16 00:26:32,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:32,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-16 00:26:32,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:32,824 INFO L225 Difference]: With dead ends: 1712 [2019-11-16 00:26:32,824 INFO L226 Difference]: Without dead ends: 894 [2019-11-16 00:26:32,825 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-16 00:26:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-11-16 00:26:32,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 858. [2019-11-16 00:26:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-11-16 00:26:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1224 transitions. [2019-11-16 00:26:32,848 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1224 transitions. Word has length 170 [2019-11-16 00:26:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:32,849 INFO L462 AbstractCegarLoop]: Abstraction has 858 states and 1224 transitions. [2019-11-16 00:26:32,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1224 transitions. [2019-11-16 00:26:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-16 00:26:32,854 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:32,855 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:32,855 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:32,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1681812864, now seen corresponding path program 1 times [2019-11-16 00:26:32,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:32,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9486422] [2019-11-16 00:26:32,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:32,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:32,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-16 00:26:32,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9486422] [2019-11-16 00:26:32,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:32,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:32,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980761954] [2019-11-16 00:26:32,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:32,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:32,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:32,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:32,934 INFO L87 Difference]: Start difference. First operand 858 states and 1224 transitions. Second operand 3 states. [2019-11-16 00:26:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:33,121 INFO L93 Difference]: Finished difference Result 1862 states and 2673 transitions. [2019-11-16 00:26:33,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:33,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-11-16 00:26:33,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:33,127 INFO L225 Difference]: With dead ends: 1862 [2019-11-16 00:26:33,127 INFO L226 Difference]: Without dead ends: 987 [2019-11-16 00:26:33,132 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-16 00:26:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-11-16 00:26:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 951. [2019-11-16 00:26:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-11-16 00:26:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1356 transitions. [2019-11-16 00:26:33,159 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1356 transitions. Word has length 194 [2019-11-16 00:26:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:33,161 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1356 transitions. [2019-11-16 00:26:33,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1356 transitions. [2019-11-16 00:26:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-16 00:26:33,165 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:33,165 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:33,165 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:33,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1348358718, now seen corresponding path program 1 times [2019-11-16 00:26:33,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:33,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197697047] [2019-11-16 00:26:33,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:33,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:33,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-16 00:26:33,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197697047] [2019-11-16 00:26:33,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:33,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:33,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125609248] [2019-11-16 00:26:33,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:33,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:33,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:33,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:33,259 INFO L87 Difference]: Start difference. First operand 951 states and 1356 transitions. Second operand 3 states. [2019-11-16 00:26:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:33,304 INFO L93 Difference]: Finished difference Result 2833 states and 4038 transitions. [2019-11-16 00:26:33,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:33,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-16 00:26:33,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:33,315 INFO L225 Difference]: With dead ends: 2833 [2019-11-16 00:26:33,315 INFO L226 Difference]: Without dead ends: 1892 [2019-11-16 00:26:33,317 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-16 00:26:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2019-11-16 00:26:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1890. [2019-11-16 00:26:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2019-11-16 00:26:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2693 transitions. [2019-11-16 00:26:33,377 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2693 transitions. Word has length 224 [2019-11-16 00:26:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:33,378 INFO L462 AbstractCegarLoop]: Abstraction has 1890 states and 2693 transitions. [2019-11-16 00:26:33,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2693 transitions. [2019-11-16 00:26:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-16 00:26:33,383 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:33,384 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:33,384 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash 132204992, now seen corresponding path program 1 times [2019-11-16 00:26:33,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:33,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210715266] [2019-11-16 00:26:33,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:33,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:33,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-11-16 00:26:33,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210715266] [2019-11-16 00:26:33,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:33,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:33,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155721289] [2019-11-16 00:26:33,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:33,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:33,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:33,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:33,507 INFO L87 Difference]: Start difference. First operand 1890 states and 2693 transitions. Second operand 3 states. [2019-11-16 00:26:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:33,704 INFO L93 Difference]: Finished difference Result 4076 states and 5839 transitions. [2019-11-16 00:26:33,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:33,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-16 00:26:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:33,717 INFO L225 Difference]: With dead ends: 4076 [2019-11-16 00:26:33,717 INFO L226 Difference]: Without dead ends: 2166 [2019-11-16 00:26:33,720 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-16 00:26:33,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2019-11-16 00:26:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2100. [2019-11-16 00:26:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-16 00:26:33,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3005 transitions. [2019-11-16 00:26:33,778 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3005 transitions. Word has length 224 [2019-11-16 00:26:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:33,778 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 3005 transitions. [2019-11-16 00:26:33,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:33,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3005 transitions. [2019-11-16 00:26:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-16 00:26:33,784 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:33,784 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:33,784 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:33,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:33,785 INFO L82 PathProgramCache]: Analyzing trace with hash 912871510, now seen corresponding path program 1 times [2019-11-16 00:26:33,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:33,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337656920] [2019-11-16 00:26:33,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:33,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:33,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2019-11-16 00:26:33,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337656920] [2019-11-16 00:26:33,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:33,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:33,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703246113] [2019-11-16 00:26:33,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:33,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:33,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:33,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:33,880 INFO L87 Difference]: Start difference. First operand 2100 states and 3005 transitions. Second operand 3 states. [2019-11-16 00:26:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:34,077 INFO L93 Difference]: Finished difference Result 4256 states and 6073 transitions. [2019-11-16 00:26:34,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:34,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-11-16 00:26:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:34,090 INFO L225 Difference]: With dead ends: 4256 [2019-11-16 00:26:34,090 INFO L226 Difference]: Without dead ends: 2148 [2019-11-16 00:26:34,093 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-16 00:26:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2019-11-16 00:26:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2082. [2019-11-16 00:26:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-16 00:26:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2951 transitions. [2019-11-16 00:26:34,150 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2951 transitions. Word has length 259 [2019-11-16 00:26:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:34,151 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 2951 transitions. [2019-11-16 00:26:34,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2951 transitions. [2019-11-16 00:26:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-16 00:26:34,157 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:34,157 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:34,157 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:34,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:34,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1837028224, now seen corresponding path program 1 times [2019-11-16 00:26:34,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:34,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545434525] [2019-11-16 00:26:34,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:34,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:34,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2019-11-16 00:26:34,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545434525] [2019-11-16 00:26:34,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:34,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:34,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719194231] [2019-11-16 00:26:34,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:34,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:34,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:34,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:34,345 INFO L87 Difference]: Start difference. First operand 2082 states and 2951 transitions. Second operand 3 states. [2019-11-16 00:26:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:34,418 INFO L93 Difference]: Finished difference Result 6211 states and 8802 transitions. [2019-11-16 00:26:34,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:34,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-16 00:26:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:34,441 INFO L225 Difference]: With dead ends: 6211 [2019-11-16 00:26:34,441 INFO L226 Difference]: Without dead ends: 4139 [2019-11-16 00:26:34,445 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-16 00:26:34,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2019-11-16 00:26:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 4137. [2019-11-16 00:26:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2019-11-16 00:26:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5847 transitions. [2019-11-16 00:26:34,572 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5847 transitions. Word has length 269 [2019-11-16 00:26:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:34,573 INFO L462 AbstractCegarLoop]: Abstraction has 4137 states and 5847 transitions. [2019-11-16 00:26:34,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5847 transitions. [2019-11-16 00:26:34,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-16 00:26:34,582 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:34,583 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:34,583 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:34,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:34,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1739569540, now seen corresponding path program 1 times [2019-11-16 00:26:34,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:34,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983674713] [2019-11-16 00:26:34,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:34,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:34,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-16 00:26:34,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983674713] [2019-11-16 00:26:34,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:34,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:34,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279118673] [2019-11-16 00:26:34,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:34,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:34,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:34,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:34,733 INFO L87 Difference]: Start difference. First operand 4137 states and 5847 transitions. Second operand 3 states. [2019-11-16 00:26:34,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:34,962 INFO L93 Difference]: Finished difference Result 8369 states and 11808 transitions. [2019-11-16 00:26:34,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:34,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-16 00:26:34,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:34,986 INFO L225 Difference]: With dead ends: 8369 [2019-11-16 00:26:34,987 INFO L226 Difference]: Without dead ends: 4245 [2019-11-16 00:26:34,993 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-16 00:26:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4245 states. [2019-11-16 00:26:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4245 to 4137. [2019-11-16 00:26:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2019-11-16 00:26:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5739 transitions. [2019-11-16 00:26:35,115 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5739 transitions. Word has length 269 [2019-11-16 00:26:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:35,115 INFO L462 AbstractCegarLoop]: Abstraction has 4137 states and 5739 transitions. [2019-11-16 00:26:35,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5739 transitions. [2019-11-16 00:26:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-11-16 00:26:35,126 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:35,126 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 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-16 00:26:35,127 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:35,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:35,127 INFO L82 PathProgramCache]: Analyzing trace with hash 938764333, now seen corresponding path program 1 times [2019-11-16 00:26:35,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:35,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198294941] [2019-11-16 00:26:35,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:35,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:35,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-16 00:26:35,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198294941] [2019-11-16 00:26:35,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:35,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:35,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995978277] [2019-11-16 00:26:35,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:35,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:35,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:35,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:35,238 INFO L87 Difference]: Start difference. First operand 4137 states and 5739 transitions. Second operand 3 states. [2019-11-16 00:26:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:35,509 INFO L93 Difference]: Finished difference Result 8855 states and 12162 transitions. [2019-11-16 00:26:35,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:35,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-11-16 00:26:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:35,535 INFO L225 Difference]: With dead ends: 8855 [2019-11-16 00:26:35,535 INFO L226 Difference]: Without dead ends: 4731 [2019-11-16 00:26:35,540 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-16 00:26:35,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-11-16 00:26:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4311. [2019-11-16 00:26:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2019-11-16 00:26:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 5973 transitions. [2019-11-16 00:26:35,664 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 5973 transitions. Word has length 296 [2019-11-16 00:26:35,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:35,664 INFO L462 AbstractCegarLoop]: Abstraction has 4311 states and 5973 transitions. [2019-11-16 00:26:35,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:35,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 5973 transitions. [2019-11-16 00:26:35,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-11-16 00:26:35,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:35,674 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:35,674 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:35,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1894222412, now seen corresponding path program 1 times [2019-11-16 00:26:35,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:35,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504428444] [2019-11-16 00:26:35,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:35,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:35,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-16 00:26:35,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504428444] [2019-11-16 00:26:35,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:35,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:35,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251357822] [2019-11-16 00:26:35,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:35,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:35,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:35,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:35,785 INFO L87 Difference]: Start difference. First operand 4311 states and 5973 transitions. Second operand 3 states. [2019-11-16 00:26:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:36,047 INFO L93 Difference]: Finished difference Result 8933 states and 12252 transitions. [2019-11-16 00:26:36,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:36,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-11-16 00:26:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:36,074 INFO L225 Difference]: With dead ends: 8933 [2019-11-16 00:26:36,080 INFO L226 Difference]: Without dead ends: 4131 [2019-11-16 00:26:36,085 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-16 00:26:36,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2019-11-16 00:26:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 4113. [2019-11-16 00:26:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4113 states. [2019-11-16 00:26:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 5679 transitions. [2019-11-16 00:26:36,186 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 5679 transitions. Word has length 297 [2019-11-16 00:26:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:36,187 INFO L462 AbstractCegarLoop]: Abstraction has 4113 states and 5679 transitions. [2019-11-16 00:26:36,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 5679 transitions. [2019-11-16 00:26:36,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-16 00:26:36,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:36,197 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:36,197 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:36,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:36,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1483906000, now seen corresponding path program 1 times [2019-11-16 00:26:36,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:36,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749365008] [2019-11-16 00:26:36,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:36,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:36,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-16 00:26:36,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749365008] [2019-11-16 00:26:36,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171589958] [2019-11-16 00:26:36,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/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-16 00:26:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:36,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:26:36,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2019-11-16 00:26:36,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:36,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-16 00:26:36,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762663831] [2019-11-16 00:26:36,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:36,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:36,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:36,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:26:36,607 INFO L87 Difference]: Start difference. First operand 4113 states and 5679 transitions. Second operand 3 states. [2019-11-16 00:26:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:36,676 INFO L93 Difference]: Finished difference Result 6199 states and 8538 transitions. [2019-11-16 00:26:36,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:36,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-16 00:26:36,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:36,685 INFO L225 Difference]: With dead ends: 6199 [2019-11-16 00:26:36,686 INFO L226 Difference]: Without dead ends: 4115 [2019-11-16 00:26:36,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 307 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-16 00:26:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2019-11-16 00:26:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 4101. [2019-11-16 00:26:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2019-11-16 00:26:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5643 transitions. [2019-11-16 00:26:36,791 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5643 transitions. Word has length 307 [2019-11-16 00:26:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:36,792 INFO L462 AbstractCegarLoop]: Abstraction has 4101 states and 5643 transitions. [2019-11-16 00:26:36,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5643 transitions. [2019-11-16 00:26:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-16 00:26:36,802 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:36,803 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:37,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:37,009 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:37,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:37,009 INFO L82 PathProgramCache]: Analyzing trace with hash -321532334, now seen corresponding path program 1 times [2019-11-16 00:26:37,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:37,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845895566] [2019-11-16 00:26:37,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:37,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:37,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:37,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-16 00:26:37,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845895566] [2019-11-16 00:26:37,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562665309] [2019-11-16 00:26:37,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/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-16 00:26:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:37,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:26:37,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-16 00:26:37,440 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:37,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:26:37,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229369605] [2019-11-16 00:26:37,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:37,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:37,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:37,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:37,443 INFO L87 Difference]: Start difference. First operand 4101 states and 5643 transitions. Second operand 4 states. [2019-11-16 00:26:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:37,811 INFO L93 Difference]: Finished difference Result 7278 states and 10118 transitions. [2019-11-16 00:26:37,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:26:37,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-11-16 00:26:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:37,822 INFO L225 Difference]: With dead ends: 7278 [2019-11-16 00:26:37,822 INFO L226 Difference]: Without dead ends: 5086 [2019-11-16 00:26:37,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 309 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-16 00:26:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5086 states. [2019-11-16 00:26:37,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5086 to 4274. [2019-11-16 00:26:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2019-11-16 00:26:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5908 transitions. [2019-11-16 00:26:37,945 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5908 transitions. Word has length 307 [2019-11-16 00:26:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:37,946 INFO L462 AbstractCegarLoop]: Abstraction has 4274 states and 5908 transitions. [2019-11-16 00:26:37,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5908 transitions. [2019-11-16 00:26:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-16 00:26:37,956 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:37,956 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:38,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:38,165 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:38,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:38,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1368718125, now seen corresponding path program 1 times [2019-11-16 00:26:38,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:38,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367159885] [2019-11-16 00:26:38,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:38,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:38,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-16 00:26:38,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367159885] [2019-11-16 00:26:38,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187179701] [2019-11-16 00:26:38,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/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-16 00:26:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:38,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:26:38,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-16 00:26:38,499 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:38,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:26:38,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599163517] [2019-11-16 00:26:38,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:38,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:38,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:38,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:38,504 INFO L87 Difference]: Start difference. First operand 4274 states and 5908 transitions. Second operand 4 states. [2019-11-16 00:26:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:38,782 INFO L93 Difference]: Finished difference Result 5429 states and 7539 transitions. [2019-11-16 00:26:38,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:38,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-11-16 00:26:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:38,787 INFO L225 Difference]: With dead ends: 5429 [2019-11-16 00:26:38,787 INFO L226 Difference]: Without dead ends: 2207 [2019-11-16 00:26:38,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 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-16 00:26:38,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-11-16 00:26:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2019-11-16 00:26:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-11-16 00:26:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 3065 transitions. [2019-11-16 00:26:38,847 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 3065 transitions. Word has length 308 [2019-11-16 00:26:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:38,847 INFO L462 AbstractCegarLoop]: Abstraction has 2207 states and 3065 transitions. [2019-11-16 00:26:38,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3065 transitions. [2019-11-16 00:26:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-11-16 00:26:38,856 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:38,856 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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-16 00:26:39,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:39,061 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1115026887, now seen corresponding path program 1 times [2019-11-16 00:26:39,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:39,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340234830] [2019-11-16 00:26:39,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:39,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:39,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-16 00:26:39,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340234830] [2019-11-16 00:26:39,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864774337] [2019-11-16 00:26:39,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/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-16 00:26:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:39,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:26:39,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-16 00:26:39,433 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:39,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:26:39,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998879171] [2019-11-16 00:26:39,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:39,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:39,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:39,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:39,435 INFO L87 Difference]: Start difference. First operand 2207 states and 3065 transitions. Second operand 4 states. [2019-11-16 00:26:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:39,702 INFO L93 Difference]: Finished difference Result 3153 states and 4322 transitions. [2019-11-16 00:26:39,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:39,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-11-16 00:26:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:39,703 INFO L225 Difference]: With dead ends: 3153 [2019-11-16 00:26:39,703 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:26:39,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 335 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-16 00:26:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:26:39,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:26:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:26:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:26:39,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 333 [2019-11-16 00:26:39,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:39,709 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:26:39,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:26:39,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:26:39,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:39,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:26:40,425 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 3 [2019-11-16 00:26:40,612 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-11-16 00:26:41,047 INFO L446 ceAbstractionStarter]: At program point L630(lines 622 632) the Hoare annotation is: true [2019-11-16 00:26:41,047 INFO L443 ceAbstractionStarter]: For program point L300(lines 300 304) no Hoare annotation was computed. [2019-11-16 00:26:41,047 INFO L443 ceAbstractionStarter]: For program point L300-2(lines 300 304) no Hoare annotation was computed. [2019-11-16 00:26:41,047 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 549) no Hoare annotation was computed. [2019-11-16 00:26:41,048 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 560) no Hoare annotation was computed. [2019-11-16 00:26:41,048 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 571) no Hoare annotation was computed. [2019-11-16 00:26:41,048 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 437) no Hoare annotation was computed. [2019-11-16 00:26:41,048 INFO L443 ceAbstractionStarter]: For program point L433-2(lines 203 535) no Hoare annotation was computed. [2019-11-16 00:26:41,048 INFO L446 ceAbstractionStarter]: At program point L202(lines 201 538) the Hoare annotation is: true [2019-11-16 00:26:41,048 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 550) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:26:41,048 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 571) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= ULTIMATE.start_ssl3_connect_~s__state~0 12292)) [2019-11-16 00:26:41,048 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 372) no Hoare annotation was computed. [2019-11-16 00:26:41,048 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 407) no Hoare annotation was computed. [2019-11-16 00:26:41,048 INFO L443 ceAbstractionStarter]: For program point L402-2(lines 402 407) no Hoare annotation was computed. [2019-11-16 00:26:41,048 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 548) no Hoare annotation was computed. [2019-11-16 00:26:41,049 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 559) no Hoare annotation was computed. [2019-11-16 00:26:41,049 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 570) no Hoare annotation was computed. [2019-11-16 00:26:41,049 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 560) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:26:41,049 INFO L439 ceAbstractionStarter]: At program point L536(lines 99 602) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (not .cse1) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse3) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0 .cse4 .cse1 .cse5) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0) (and .cse2 .cse0 .cse3 .cse4 .cse1 .cse5) (<= ULTIMATE.start_ssl3_connect_~s__state~0 3))) [2019-11-16 00:26:41,049 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-11-16 00:26:41,049 INFO L446 ceAbstractionStarter]: At program point L603(lines 98 604) the Hoare annotation is: true [2019-11-16 00:26:41,049 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 547) no Hoare annotation was computed. [2019-11-16 00:26:41,049 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 558) no Hoare annotation was computed. [2019-11-16 00:26:41,049 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 569) no Hoare annotation was computed. [2019-11-16 00:26:41,049 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 377) no Hoare annotation was computed. [2019-11-16 00:26:41,050 INFO L443 ceAbstractionStarter]: For program point L373-2(lines 373 377) no Hoare annotation was computed. [2019-11-16 00:26:41,050 INFO L439 ceAbstractionStarter]: At program point L208(lines 105 570) the Hoare annotation is: (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) [2019-11-16 00:26:41,050 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 548) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:26:41,050 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 600) no Hoare annotation was computed. [2019-11-16 00:26:41,050 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-16 00:26:41,050 INFO L443 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-11-16 00:26:41,050 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 597) no Hoare annotation was computed. [2019-11-16 00:26:41,050 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 203 535) no Hoare annotation was computed. [2019-11-16 00:26:41,050 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 347) no Hoare annotation was computed. [2019-11-16 00:26:41,050 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-11-16 00:26:41,050 INFO L443 ceAbstractionStarter]: For program point L309-1(lines 309 323) no Hoare annotation was computed. [2019-11-16 00:26:41,050 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 546) no Hoare annotation was computed. [2019-11-16 00:26:41,050 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 557) no Hoare annotation was computed. [2019-11-16 00:26:41,051 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 568) no Hoare annotation was computed. [2019-11-16 00:26:41,051 INFO L443 ceAbstractionStarter]: For program point L607(lines 607 611) no Hoare annotation was computed. [2019-11-16 00:26:41,051 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 583) no Hoare annotation was computed. [2019-11-16 00:26:41,051 INFO L443 ceAbstractionStarter]: For program point L607-2(lines 607 611) no Hoare annotation was computed. [2019-11-16 00:26:41,051 INFO L443 ceAbstractionStarter]: For program point L574-2(lines 573 595) no Hoare annotation was computed. [2019-11-16 00:26:41,051 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 558) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:26:41,051 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 580) no Hoare annotation was computed. [2019-11-16 00:26:41,051 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 449) no Hoare annotation was computed. [2019-11-16 00:26:41,051 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 217) no Hoare annotation was computed. [2019-11-16 00:26:41,051 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 545) no Hoare annotation was computed. [2019-11-16 00:26:41,051 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 556) no Hoare annotation was computed. [2019-11-16 00:26:41,051 INFO L443 ceAbstractionStarter]: For program point L213-2(lines 203 535) no Hoare annotation was computed. [2019-11-16 00:26:41,051 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 567) no Hoare annotation was computed. [2019-11-16 00:26:41,052 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-16 00:26:41,052 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2019-11-16 00:26:41,052 INFO L443 ceAbstractionStarter]: For program point L313-2(lines 311 323) no Hoare annotation was computed. [2019-11-16 00:26:41,052 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 546) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:26:41,052 INFO L443 ceAbstractionStarter]: For program point L512-1(lines 512 516) no Hoare annotation was computed. [2019-11-16 00:26:41,052 INFO L443 ceAbstractionStarter]: For program point L413(lines 413 417) no Hoare annotation was computed. [2019-11-16 00:26:41,057 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2019-11-16 00:26:41,057 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 544) no Hoare annotation was computed. [2019-11-16 00:26:41,057 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 555) no Hoare annotation was computed. [2019-11-16 00:26:41,057 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 566) no Hoare annotation was computed. [2019-11-16 00:26:41,057 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-16 00:26:41,057 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 66 620) no Hoare annotation was computed. [2019-11-16 00:26:41,058 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 556) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:26:41,058 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-11-16 00:26:41,058 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:26:41,058 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 487) no Hoare annotation was computed. [2019-11-16 00:26:41,058 INFO L443 ceAbstractionStarter]: For program point L483-2(lines 483 487) no Hoare annotation was computed. [2019-11-16 00:26:41,058 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 293) no Hoare annotation was computed. [2019-11-16 00:26:41,058 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 543) no Hoare annotation was computed. [2019-11-16 00:26:41,059 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 554) no Hoare annotation was computed. [2019-11-16 00:26:41,059 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 565) no Hoare annotation was computed. [2019-11-16 00:26:41,059 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 389) no Hoare annotation was computed. [2019-11-16 00:26:41,059 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 356) no Hoare annotation was computed. [2019-11-16 00:26:41,059 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 544) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (not (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) .cse0 .cse1) (and (and .cse0 .cse1) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)))) [2019-11-16 00:26:41,059 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 566) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:26:41,059 INFO L439 ceAbstractionStarter]: At program point L353(lines 66 620) the Hoare annotation is: false [2019-11-16 00:26:41,060 INFO L446 ceAbstractionStarter]: At program point L618(lines 66 620) the Hoare annotation is: true [2019-11-16 00:26:41,060 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 591) no Hoare annotation was computed. [2019-11-16 00:26:41,060 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-16 00:26:41,060 INFO L443 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-11-16 00:26:41,060 INFO L443 ceAbstractionStarter]: For program point L288(lines 288 292) no Hoare annotation was computed. [2019-11-16 00:26:41,061 INFO L443 ceAbstractionStarter]: For program point L288-2(lines 203 535) no Hoare annotation was computed. [2019-11-16 00:26:41,062 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 542) no Hoare annotation was computed. [2019-11-16 00:26:41,062 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 553) no Hoare annotation was computed. [2019-11-16 00:26:41,062 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 564) no Hoare annotation was computed. [2019-11-16 00:26:41,063 INFO L446 ceAbstractionStarter]: At program point L619(lines 8 621) the Hoare annotation is: true [2019-11-16 00:26:41,065 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 458) no Hoare annotation was computed. [2019-11-16 00:26:41,065 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:26:41,065 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 614) no Hoare annotation was computed. [2019-11-16 00:26:41,065 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-16 00:26:41,065 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 242) no Hoare annotation was computed. [2019-11-16 00:26:41,065 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 541) no Hoare annotation was computed. [2019-11-16 00:26:41,065 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 552) no Hoare annotation was computed. [2019-11-16 00:26:41,066 INFO L443 ceAbstractionStarter]: For program point L225-2(lines 203 535) no Hoare annotation was computed. [2019-11-16 00:26:41,066 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 563) no Hoare annotation was computed. [2019-11-16 00:26:41,066 INFO L439 ceAbstractionStarter]: At program point L193(lines 189 542) the Hoare annotation is: (or (and (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) [2019-11-16 00:26:41,066 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 564) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:26:41,066 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:26:41,066 INFO L443 ceAbstractionStarter]: For program point L491-1(lines 491 503) no Hoare annotation was computed. [2019-11-16 00:26:41,067 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 429) no Hoare annotation was computed. [2019-11-16 00:26:41,067 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 232) no Hoare annotation was computed. [2019-11-16 00:26:41,067 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 540) no Hoare annotation was computed. [2019-11-16 00:26:41,067 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 551) no Hoare annotation was computed. [2019-11-16 00:26:41,067 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 562) no Hoare annotation was computed. [2019-11-16 00:26:41,067 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-16 00:26:41,067 INFO L439 ceAbstractionStarter]: At program point L196(lines 195 540) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and (not .cse2) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse3 .cse1) (and .cse0 .cse3 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-16 00:26:41,068 INFO L439 ceAbstractionStarter]: At program point L163(lines 153 554) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:26:41,068 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 499) no Hoare annotation was computed. [2019-11-16 00:26:41,068 INFO L443 ceAbstractionStarter]: For program point L461(lines 461 472) no Hoare annotation was computed. [2019-11-16 00:26:41,068 INFO L443 ceAbstractionStarter]: For program point L461-1(lines 461 472) no Hoare annotation was computed. [2019-11-16 00:26:41,068 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 267) no Hoare annotation was computed. [2019-11-16 00:26:41,068 INFO L443 ceAbstractionStarter]: For program point L263-2(lines 203 535) no Hoare annotation was computed. [2019-11-16 00:26:41,068 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 400) no Hoare annotation was computed. [2019-11-16 00:26:41,069 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2019-11-16 00:26:41,069 INFO L443 ceAbstractionStarter]: For program point L330-2(lines 203 535) no Hoare annotation was computed. [2019-11-16 00:26:41,069 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 539) no Hoare annotation was computed. [2019-11-16 00:26:41,069 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 550) no Hoare annotation was computed. [2019-11-16 00:26:41,069 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 561) no Hoare annotation was computed. [2019-11-16 00:26:41,069 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 66 620) no Hoare annotation was computed. [2019-11-16 00:26:41,069 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 469) no Hoare annotation was computed. [2019-11-16 00:26:41,069 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 539) the Hoare annotation is: true [2019-11-16 00:26:41,070 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 562) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:26:41,070 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:26:41,070 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 238) no Hoare annotation was computed. [2019-11-16 00:26:41,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:26:41 BoogieIcfgContainer [2019-11-16 00:26:41,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:26:41,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:26:41,111 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:26:41,111 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:26:41,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:29" (3/4) ... [2019-11-16 00:26:41,115 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:26:41,140 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-16 00:26:41,141 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:26:41,283 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dc7c6a77-74d2-43a2-8e90-730e2bf8ed58/bin/uautomizer/witness.graphml [2019-11-16 00:26:41,283 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:26:41,285 INFO L168 Benchmark]: Toolchain (without parser) took 12785.34 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 665.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -127.6 MB). Peak memory consumption was 538.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:41,285 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:26:41,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:41,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:41,287 INFO L168 Benchmark]: Boogie Preprocessor took 58.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:41,287 INFO L168 Benchmark]: RCFGBuilder took 743.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:41,288 INFO L168 Benchmark]: TraceAbstraction took 11288.62 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 544.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.3 MB). Peak memory consumption was 508.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:41,288 INFO L168 Benchmark]: Witness Printer took 172.57 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:41,290 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 463.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 743.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11288.62 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 544.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.3 MB). Peak memory consumption was 508.9 MB. Max. memory is 11.5 GB. * Witness Printer took 172.57 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 614]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) || ((((!(0 == s__hit) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && blastFlag <= 4) && 4352 <= s__state)) || blastFlag <= 2) || (((((4560 <= s__state && s__state <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (4416 == s__state && blastFlag <= 4)) || (((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || s__state <= 3 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(0 == s__hit) && blastFlag <= 4) && 4432 <= s__state) || ((blastFlag <= 4 && 4432 <= s__state) && s__state <= 4560) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (blastFlag <= 4 && s__state <= 4448) && 4432 <= s__state - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: blastFlag <= 2 && s__state == 12292 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: (0 == s__hit && 4432 <= s__state) || (4560 <= s__state && blastFlag <= 2) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (s__state <= 4480 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (s__state <= 4480 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) || ((((!(0 == s__hit) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && blastFlag <= 4) && 4352 <= s__state)) || (((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Result: SAFE, OverallTime: 11.1s, OverallIterations: 21, TraceHistogramMax: 15, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 4033 SDtfs, 1585 SDslu, 2268 SDs, 0 SdLazy, 1977 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1323 GetRequests, 1294 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4311occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 1655 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 191 NumberOfFragments, 281 HoareAnnotationTreeSize, 23 FomulaSimplifications, 13989 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 23 FomulaSimplificationsInter, 8919 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 5351 NumberOfCodeBlocks, 5351 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 5326 ConstructedInterpolants, 0 QuantifiedInterpolants, 2023446 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2379 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 16460/16530 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 correct! Received shutdown request...