./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c1b0557200bb93e177956c2673df3bb0520e234 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 19:36:12,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:36:12,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:36:12,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:36:12,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:36:12,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:36:12,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:36:12,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:36:12,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:36:12,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:36:12,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:36:12,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:36:12,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:36:12,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:36:12,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:36:12,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:36:12,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:36:12,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:36:12,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:36:12,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:36:12,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:36:12,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:36:12,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:36:12,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:36:12,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:36:12,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:36:12,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:36:12,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:36:12,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:36:12,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:36:12,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:36:12,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:36:12,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:36:12,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:36:12,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:36:12,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:36:12,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:36:12,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:36:12,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:36:12,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:36:12,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:36:12,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 19:36:12,984 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:36:12,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:36:12,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:36:12,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:36:12,990 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:36:12,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:36:12,991 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:36:12,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 19:36:12,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:36:12,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:36:12,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:36:12,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:36:12,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:36:12,994 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:36:12,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:36:12,995 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:36:12,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:36:12,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:36:12,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:36:12,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:36:12,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:36:12,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:36:12,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:36:12,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:36:12,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:36:12,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 19:36:12,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 19:36:12,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:36:12,998 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:36:12,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> 3c1b0557200bb93e177956c2673df3bb0520e234 [2020-10-25 19:36:13,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:36:13,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:36:13,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:36:13,428 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:36:13,429 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:36:13,431 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2020-10-25 19:36:13,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd9d53305/57be1de0a1114a83af7afb06dfde6f66/FLAGac631b51b [2020-10-25 19:36:14,076 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:36:14,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2020-10-25 19:36:14,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd9d53305/57be1de0a1114a83af7afb06dfde6f66/FLAGac631b51b [2020-10-25 19:36:14,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd9d53305/57be1de0a1114a83af7afb06dfde6f66 [2020-10-25 19:36:14,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:36:14,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:36:14,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:36:14,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:36:14,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:36:14,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:36:14" (1/1) ... [2020-10-25 19:36:14,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c02764e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14, skipping insertion in model container [2020-10-25 19:36:14,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:36:14" (1/1) ... [2020-10-25 19:36:14,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:36:14,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:36:14,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:36:14,815 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:36:14,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:36:14,968 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:36:14,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14 WrapperNode [2020-10-25 19:36:14,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:36:14,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:36:14,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:36:14,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:36:14,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14" (1/1) ... [2020-10-25 19:36:15,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14" (1/1) ... [2020-10-25 19:36:15,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:36:15,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:36:15,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:36:15,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:36:15,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14" (1/1) ... [2020-10-25 19:36:15,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14" (1/1) ... [2020-10-25 19:36:15,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14" (1/1) ... [2020-10-25 19:36:15,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14" (1/1) ... [2020-10-25 19:36:15,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14" (1/1) ... [2020-10-25 19:36:15,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14" (1/1) ... [2020-10-25 19:36:15,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14" (1/1) ... [2020-10-25 19:36:15,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:36:15,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:36:15,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:36:15,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:36:15,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 19:36:15,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 19:36:15,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:36:15,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:36:15,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:36:15,490 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-25 19:36:16,043 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2020-10-25 19:36:16,044 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2020-10-25 19:36:16,055 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:36:16,055 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 19:36:16,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:36:16 BoogieIcfgContainer [2020-10-25 19:36:16,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:36:16,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:36:16,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:36:16,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:36:16,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:36:14" (1/3) ... [2020-10-25 19:36:16,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3125a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:36:16, skipping insertion in model container [2020-10-25 19:36:16,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:36:14" (2/3) ... [2020-10-25 19:36:16,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3125a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:36:16, skipping insertion in model container [2020-10-25 19:36:16,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:36:16" (3/3) ... [2020-10-25 19:36:16,068 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2020-10-25 19:36:16,085 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:36:16,091 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:36:16,103 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:36:16,134 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:36:16,134 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:36:16,134 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:36:16,135 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:36:16,135 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:36:16,135 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:36:16,135 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:36:16,135 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:36:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2020-10-25 19:36:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-25 19:36:16,165 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:16,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:16,167 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:16,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:16,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1632003015, now seen corresponding path program 1 times [2020-10-25 19:36:16,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:16,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964620449] [2020-10-25 19:36:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:36:16,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964620449] [2020-10-25 19:36:16,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:16,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:16,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609591159] [2020-10-25 19:36:16,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:16,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:16,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:16,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:16,483 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 3 states. [2020-10-25 19:36:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:16,880 INFO L93 Difference]: Finished difference Result 324 states and 560 transitions. [2020-10-25 19:36:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:16,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-10-25 19:36:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:16,919 INFO L225 Difference]: With dead ends: 324 [2020-10-25 19:36:16,920 INFO L226 Difference]: Without dead ends: 171 [2020-10-25 19:36:16,925 INFO L677 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 [2020-10-25 19:36:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-25 19:36:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2020-10-25 19:36:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-10-25 19:36:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 271 transitions. [2020-10-25 19:36:16,993 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 271 transitions. Word has length 44 [2020-10-25 19:36:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:16,994 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 271 transitions. [2020-10-25 19:36:16,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 271 transitions. [2020-10-25 19:36:16,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-25 19:36:16,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:16,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:16,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 19:36:16,997 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:16,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:16,998 INFO L82 PathProgramCache]: Analyzing trace with hash -954579415, now seen corresponding path program 1 times [2020-10-25 19:36:16,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:16,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286121748] [2020-10-25 19:36:16,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:36:17,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286121748] [2020-10-25 19:36:17,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:17,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:17,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261749014] [2020-10-25 19:36:17,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:17,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:17,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:17,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:17,128 INFO L87 Difference]: Start difference. First operand 166 states and 271 transitions. Second operand 3 states. [2020-10-25 19:36:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:17,509 INFO L93 Difference]: Finished difference Result 372 states and 616 transitions. [2020-10-25 19:36:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:17,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-10-25 19:36:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:17,512 INFO L225 Difference]: With dead ends: 372 [2020-10-25 19:36:17,513 INFO L226 Difference]: Without dead ends: 212 [2020-10-25 19:36:17,514 INFO L677 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 [2020-10-25 19:36:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-10-25 19:36:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2020-10-25 19:36:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-10-25 19:36:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 348 transitions. [2020-10-25 19:36:17,538 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 348 transitions. Word has length 45 [2020-10-25 19:36:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:17,539 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 348 transitions. [2020-10-25 19:36:17,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 348 transitions. [2020-10-25 19:36:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-25 19:36:17,543 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:17,543 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:17,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 19:36:17,544 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:17,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash -420309214, now seen corresponding path program 1 times [2020-10-25 19:36:17,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:17,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263948539] [2020-10-25 19:36:17,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:36:17,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263948539] [2020-10-25 19:36:17,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:17,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:17,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330157554] [2020-10-25 19:36:17,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:17,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:17,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:17,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:17,656 INFO L87 Difference]: Start difference. First operand 207 states and 348 transitions. Second operand 3 states. [2020-10-25 19:36:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:17,927 INFO L93 Difference]: Finished difference Result 437 states and 742 transitions. [2020-10-25 19:36:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:17,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-10-25 19:36:17,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:17,931 INFO L225 Difference]: With dead ends: 437 [2020-10-25 19:36:17,931 INFO L226 Difference]: Without dead ends: 238 [2020-10-25 19:36:17,932 INFO L677 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 [2020-10-25 19:36:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-10-25 19:36:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2020-10-25 19:36:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-10-25 19:36:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 404 transitions. [2020-10-25 19:36:17,956 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 404 transitions. Word has length 72 [2020-10-25 19:36:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:17,957 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 404 transitions. [2020-10-25 19:36:17,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 404 transitions. [2020-10-25 19:36:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-25 19:36:17,962 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:17,962 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:17,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 19:36:17,963 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:17,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1606429448, now seen corresponding path program 1 times [2020-10-25 19:36:17,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:17,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000972379] [2020-10-25 19:36:17,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 19:36:18,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000972379] [2020-10-25 19:36:18,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:18,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:18,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583004685] [2020-10-25 19:36:18,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:18,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:18,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:18,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:18,099 INFO L87 Difference]: Start difference. First operand 238 states and 404 transitions. Second operand 3 states. [2020-10-25 19:36:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:18,319 INFO L93 Difference]: Finished difference Result 485 states and 824 transitions. [2020-10-25 19:36:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:18,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-10-25 19:36:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:18,323 INFO L225 Difference]: With dead ends: 485 [2020-10-25 19:36:18,323 INFO L226 Difference]: Without dead ends: 255 [2020-10-25 19:36:18,324 INFO L677 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 [2020-10-25 19:36:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-10-25 19:36:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2020-10-25 19:36:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-10-25 19:36:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 427 transitions. [2020-10-25 19:36:18,349 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 427 transitions. Word has length 84 [2020-10-25 19:36:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:18,350 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 427 transitions. [2020-10-25 19:36:18,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 427 transitions. [2020-10-25 19:36:18,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-25 19:36:18,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:18,360 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:18,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 19:36:18,361 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1610778141, now seen corresponding path program 1 times [2020-10-25 19:36:18,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:18,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143448759] [2020-10-25 19:36:18,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:36:18,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143448759] [2020-10-25 19:36:18,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:18,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:18,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397365647] [2020-10-25 19:36:18,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:18,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:18,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:18,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:18,475 INFO L87 Difference]: Start difference. First operand 253 states and 427 transitions. Second operand 3 states. [2020-10-25 19:36:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:18,768 INFO L93 Difference]: Finished difference Result 544 states and 923 transitions. [2020-10-25 19:36:18,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:18,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-10-25 19:36:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:18,771 INFO L225 Difference]: With dead ends: 544 [2020-10-25 19:36:18,771 INFO L226 Difference]: Without dead ends: 299 [2020-10-25 19:36:18,772 INFO L677 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 [2020-10-25 19:36:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-10-25 19:36:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2020-10-25 19:36:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-10-25 19:36:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 501 transitions. [2020-10-25 19:36:18,791 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 501 transitions. Word has length 84 [2020-10-25 19:36:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:18,791 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 501 transitions. [2020-10-25 19:36:18,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 501 transitions. [2020-10-25 19:36:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-25 19:36:18,794 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:18,794 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:18,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 19:36:18,794 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:18,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1470428767, now seen corresponding path program 1 times [2020-10-25 19:36:18,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:18,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879435931] [2020-10-25 19:36:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 19:36:18,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879435931] [2020-10-25 19:36:18,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:18,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:18,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694060310] [2020-10-25 19:36:18,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:18,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:18,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:18,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:18,871 INFO L87 Difference]: Start difference. First operand 295 states and 501 transitions. Second operand 3 states. [2020-10-25 19:36:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:19,087 INFO L93 Difference]: Finished difference Result 584 states and 992 transitions. [2020-10-25 19:36:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:19,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-10-25 19:36:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:19,090 INFO L225 Difference]: With dead ends: 584 [2020-10-25 19:36:19,090 INFO L226 Difference]: Without dead ends: 297 [2020-10-25 19:36:19,091 INFO L677 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 [2020-10-25 19:36:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-10-25 19:36:19,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2020-10-25 19:36:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-10-25 19:36:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 497 transitions. [2020-10-25 19:36:19,105 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 497 transitions. Word has length 85 [2020-10-25 19:36:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:19,105 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 497 transitions. [2020-10-25 19:36:19,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 497 transitions. [2020-10-25 19:36:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-25 19:36:19,108 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:19,109 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:19,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 19:36:19,109 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash -564791579, now seen corresponding path program 1 times [2020-10-25 19:36:19,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:19,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174036008] [2020-10-25 19:36:19,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:36:19,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174036008] [2020-10-25 19:36:19,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:19,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:19,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384951733] [2020-10-25 19:36:19,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:19,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:19,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:19,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:19,171 INFO L87 Difference]: Start difference. First operand 295 states and 497 transitions. Second operand 3 states. [2020-10-25 19:36:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:19,468 INFO L93 Difference]: Finished difference Result 586 states and 987 transitions. [2020-10-25 19:36:19,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:19,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-10-25 19:36:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:19,473 INFO L225 Difference]: With dead ends: 586 [2020-10-25 19:36:19,473 INFO L226 Difference]: Without dead ends: 297 [2020-10-25 19:36:19,476 INFO L677 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 [2020-10-25 19:36:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-10-25 19:36:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2020-10-25 19:36:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-10-25 19:36:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 492 transitions. [2020-10-25 19:36:19,493 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 492 transitions. Word has length 85 [2020-10-25 19:36:19,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:19,493 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 492 transitions. [2020-10-25 19:36:19,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 492 transitions. [2020-10-25 19:36:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-25 19:36:19,498 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:19,498 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:19,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 19:36:19,499 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:19,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:19,499 INFO L82 PathProgramCache]: Analyzing trace with hash -378579321, now seen corresponding path program 1 times [2020-10-25 19:36:19,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:19,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907467730] [2020-10-25 19:36:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-10-25 19:36:19,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907467730] [2020-10-25 19:36:19,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:19,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:19,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059368654] [2020-10-25 19:36:19,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:19,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:19,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:19,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:19,621 INFO L87 Difference]: Start difference. First operand 293 states and 492 transitions. Second operand 3 states. [2020-10-25 19:36:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:19,812 INFO L93 Difference]: Finished difference Result 586 states and 983 transitions. [2020-10-25 19:36:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:19,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-10-25 19:36:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:19,815 INFO L225 Difference]: With dead ends: 586 [2020-10-25 19:36:19,816 INFO L226 Difference]: Without dead ends: 301 [2020-10-25 19:36:19,817 INFO L677 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 [2020-10-25 19:36:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-10-25 19:36:19,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2020-10-25 19:36:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-10-25 19:36:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 497 transitions. [2020-10-25 19:36:19,830 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 497 transitions. Word has length 96 [2020-10-25 19:36:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:19,831 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 497 transitions. [2020-10-25 19:36:19,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 497 transitions. [2020-10-25 19:36:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:36:19,833 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:19,833 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:19,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 19:36:19,833 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:19,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:19,834 INFO L82 PathProgramCache]: Analyzing trace with hash 183697243, now seen corresponding path program 1 times [2020-10-25 19:36:19,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:19,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921194138] [2020-10-25 19:36:19,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:19,882 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 19:36:19,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921194138] [2020-10-25 19:36:19,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:19,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:19,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676290083] [2020-10-25 19:36:19,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:19,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:19,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:19,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:19,886 INFO L87 Difference]: Start difference. First operand 301 states and 497 transitions. Second operand 3 states. [2020-10-25 19:36:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:20,136 INFO L93 Difference]: Finished difference Result 625 states and 1035 transitions. [2020-10-25 19:36:20,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:20,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-10-25 19:36:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:20,140 INFO L225 Difference]: With dead ends: 625 [2020-10-25 19:36:20,140 INFO L226 Difference]: Without dead ends: 332 [2020-10-25 19:36:20,141 INFO L677 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 [2020-10-25 19:36:20,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-10-25 19:36:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2020-10-25 19:36:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-10-25 19:36:20,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 544 transitions. [2020-10-25 19:36:20,156 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 544 transitions. Word has length 98 [2020-10-25 19:36:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:20,156 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 544 transitions. [2020-10-25 19:36:20,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 544 transitions. [2020-10-25 19:36:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-25 19:36:20,158 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:20,158 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:20,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 19:36:20,159 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:20,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:20,159 INFO L82 PathProgramCache]: Analyzing trace with hash 156444990, now seen corresponding path program 1 times [2020-10-25 19:36:20,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:20,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124672581] [2020-10-25 19:36:20,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 19:36:20,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124672581] [2020-10-25 19:36:20,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:20,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:20,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075839924] [2020-10-25 19:36:20,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:20,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:20,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:20,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:20,206 INFO L87 Difference]: Start difference. First operand 330 states and 544 transitions. Second operand 3 states. [2020-10-25 19:36:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:20,440 INFO L93 Difference]: Finished difference Result 686 states and 1135 transitions. [2020-10-25 19:36:20,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:20,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-10-25 19:36:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:20,443 INFO L225 Difference]: With dead ends: 686 [2020-10-25 19:36:20,443 INFO L226 Difference]: Without dead ends: 364 [2020-10-25 19:36:20,444 INFO L677 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 [2020-10-25 19:36:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-10-25 19:36:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 357. [2020-10-25 19:36:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-10-25 19:36:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 586 transitions. [2020-10-25 19:36:20,461 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 586 transitions. Word has length 99 [2020-10-25 19:36:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:20,463 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 586 transitions. [2020-10-25 19:36:20,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 586 transitions. [2020-10-25 19:36:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-25 19:36:20,464 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:20,464 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-25 19:36:20,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 19:36:20,465 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:20,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:20,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2130209566, now seen corresponding path program 1 times [2020-10-25 19:36:20,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:20,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314277308] [2020-10-25 19:36:20,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 19:36:20,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314277308] [2020-10-25 19:36:20,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:20,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:20,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316309889] [2020-10-25 19:36:20,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:20,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:20,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:20,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:20,543 INFO L87 Difference]: Start difference. First operand 357 states and 586 transitions. Second operand 3 states. [2020-10-25 19:36:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:20,777 INFO L93 Difference]: Finished difference Result 708 states and 1162 transitions. [2020-10-25 19:36:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:20,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-10-25 19:36:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:20,780 INFO L225 Difference]: With dead ends: 708 [2020-10-25 19:36:20,780 INFO L226 Difference]: Without dead ends: 359 [2020-10-25 19:36:20,781 INFO L677 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 [2020-10-25 19:36:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-10-25 19:36:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2020-10-25 19:36:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-10-25 19:36:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 582 transitions. [2020-10-25 19:36:20,795 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 582 transitions. Word has length 99 [2020-10-25 19:36:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:20,796 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 582 transitions. [2020-10-25 19:36:20,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 582 transitions. [2020-10-25 19:36:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-25 19:36:20,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:20,797 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:20,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 19:36:20,798 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:20,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:20,798 INFO L82 PathProgramCache]: Analyzing trace with hash -417318601, now seen corresponding path program 1 times [2020-10-25 19:36:20,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:20,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141767286] [2020-10-25 19:36:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 19:36:20,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141767286] [2020-10-25 19:36:20,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:20,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:20,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512366264] [2020-10-25 19:36:20,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:20,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:20,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:20,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:20,849 INFO L87 Difference]: Start difference. First operand 357 states and 582 transitions. Second operand 3 states. [2020-10-25 19:36:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:21,112 INFO L93 Difference]: Finished difference Result 713 states and 1164 transitions. [2020-10-25 19:36:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:21,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-10-25 19:36:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:21,116 INFO L225 Difference]: With dead ends: 713 [2020-10-25 19:36:21,116 INFO L226 Difference]: Without dead ends: 364 [2020-10-25 19:36:21,117 INFO L677 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 [2020-10-25 19:36:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-10-25 19:36:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 357. [2020-10-25 19:36:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-10-25 19:36:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 577 transitions. [2020-10-25 19:36:21,134 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 577 transitions. Word has length 100 [2020-10-25 19:36:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:21,140 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 577 transitions. [2020-10-25 19:36:21,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 577 transitions. [2020-10-25 19:36:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-25 19:36:21,146 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:21,146 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:21,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 19:36:21,146 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:21,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1321281040, now seen corresponding path program 1 times [2020-10-25 19:36:21,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:21,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071345109] [2020-10-25 19:36:21,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-25 19:36:21,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071345109] [2020-10-25 19:36:21,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:21,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:21,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407468522] [2020-10-25 19:36:21,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:21,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:21,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:21,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:21,233 INFO L87 Difference]: Start difference. First operand 357 states and 577 transitions. Second operand 3 states. [2020-10-25 19:36:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:21,485 INFO L93 Difference]: Finished difference Result 731 states and 1183 transitions. [2020-10-25 19:36:21,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:21,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-10-25 19:36:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:21,489 INFO L225 Difference]: With dead ends: 731 [2020-10-25 19:36:21,489 INFO L226 Difference]: Without dead ends: 382 [2020-10-25 19:36:21,490 INFO L677 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 [2020-10-25 19:36:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-10-25 19:36:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2020-10-25 19:36:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-10-25 19:36:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 606 transitions. [2020-10-25 19:36:21,506 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 606 transitions. Word has length 105 [2020-10-25 19:36:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:21,507 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 606 transitions. [2020-10-25 19:36:21,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 606 transitions. [2020-10-25 19:36:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-25 19:36:21,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:21,509 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:21,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 19:36:21,510 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:21,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1276596489, now seen corresponding path program 1 times [2020-10-25 19:36:21,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:21,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812412492] [2020-10-25 19:36:21,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-25 19:36:21,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812412492] [2020-10-25 19:36:21,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:21,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:21,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130251752] [2020-10-25 19:36:21,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:21,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:21,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:21,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:21,567 INFO L87 Difference]: Start difference. First operand 378 states and 606 transitions. Second operand 3 states. [2020-10-25 19:36:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:21,801 INFO L93 Difference]: Finished difference Result 752 states and 1206 transitions. [2020-10-25 19:36:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:21,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-10-25 19:36:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:21,804 INFO L225 Difference]: With dead ends: 752 [2020-10-25 19:36:21,804 INFO L226 Difference]: Without dead ends: 382 [2020-10-25 19:36:21,805 INFO L677 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 [2020-10-25 19:36:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-10-25 19:36:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2020-10-25 19:36:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-10-25 19:36:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 600 transitions. [2020-10-25 19:36:21,824 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 600 transitions. Word has length 106 [2020-10-25 19:36:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:21,824 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 600 transitions. [2020-10-25 19:36:21,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 600 transitions. [2020-10-25 19:36:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-25 19:36:21,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:21,827 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:21,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 19:36:21,827 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:21,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:21,828 INFO L82 PathProgramCache]: Analyzing trace with hash -687746511, now seen corresponding path program 1 times [2020-10-25 19:36:21,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:21,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985413850] [2020-10-25 19:36:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:36:21,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985413850] [2020-10-25 19:36:21,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:21,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:21,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244480762] [2020-10-25 19:36:21,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:21,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:21,884 INFO L87 Difference]: Start difference. First operand 378 states and 600 transitions. Second operand 3 states. [2020-10-25 19:36:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:21,962 INFO L93 Difference]: Finished difference Result 1072 states and 1706 transitions. [2020-10-25 19:36:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:21,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-10-25 19:36:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:21,967 INFO L225 Difference]: With dead ends: 1072 [2020-10-25 19:36:21,968 INFO L226 Difference]: Without dead ends: 702 [2020-10-25 19:36:21,969 INFO L677 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 [2020-10-25 19:36:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2020-10-25 19:36:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2020-10-25 19:36:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2020-10-25 19:36:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1113 transitions. [2020-10-25 19:36:22,000 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1113 transitions. Word has length 121 [2020-10-25 19:36:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:22,001 INFO L481 AbstractCegarLoop]: Abstraction has 702 states and 1113 transitions. [2020-10-25 19:36:22,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:22,001 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1113 transitions. [2020-10-25 19:36:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-25 19:36:22,003 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:22,004 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:22,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 19:36:22,004 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:22,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:22,005 INFO L82 PathProgramCache]: Analyzing trace with hash 209646767, now seen corresponding path program 1 times [2020-10-25 19:36:22,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:22,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658698257] [2020-10-25 19:36:22,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-10-25 19:36:22,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658698257] [2020-10-25 19:36:22,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:22,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:22,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732708723] [2020-10-25 19:36:22,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:22,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:22,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:22,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:22,059 INFO L87 Difference]: Start difference. First operand 702 states and 1113 transitions. Second operand 3 states. [2020-10-25 19:36:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:22,136 INFO L93 Difference]: Finished difference Result 1072 states and 1701 transitions. [2020-10-25 19:36:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:22,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-10-25 19:36:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:22,143 INFO L225 Difference]: With dead ends: 1072 [2020-10-25 19:36:22,144 INFO L226 Difference]: Without dead ends: 1070 [2020-10-25 19:36:22,145 INFO L677 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 [2020-10-25 19:36:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2020-10-25 19:36:22,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2020-10-25 19:36:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2020-10-25 19:36:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1699 transitions. [2020-10-25 19:36:22,191 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1699 transitions. Word has length 121 [2020-10-25 19:36:22,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:22,192 INFO L481 AbstractCegarLoop]: Abstraction has 1070 states and 1699 transitions. [2020-10-25 19:36:22,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1699 transitions. [2020-10-25 19:36:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-10-25 19:36:22,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:22,196 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:22,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 19:36:22,196 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:22,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:22,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1473242480, now seen corresponding path program 1 times [2020-10-25 19:36:22,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:22,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121006737] [2020-10-25 19:36:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:22,210 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-25 19:36:22,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [77802820] [2020-10-25 19:36:22,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 19:36:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:22,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:36:22,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:36:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-25 19:36:22,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121006737] [2020-10-25 19:36:22,568 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-25 19:36:22,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77802820] [2020-10-25 19:36:22,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:22,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:22,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137717178] [2020-10-25 19:36:22,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:22,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:22,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:22,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:22,571 INFO L87 Difference]: Start difference. First operand 1070 states and 1699 transitions. Second operand 3 states. [2020-10-25 19:36:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:22,678 INFO L93 Difference]: Finished difference Result 2500 states and 3972 transitions. [2020-10-25 19:36:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:22,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2020-10-25 19:36:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:22,688 INFO L225 Difference]: With dead ends: 2500 [2020-10-25 19:36:22,688 INFO L226 Difference]: Without dead ends: 1438 [2020-10-25 19:36:22,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-10-25 19:36:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1438. [2020-10-25 19:36:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2020-10-25 19:36:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2282 transitions. [2020-10-25 19:36:22,787 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2282 transitions. Word has length 122 [2020-10-25 19:36:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:22,787 INFO L481 AbstractCegarLoop]: Abstraction has 1438 states and 2282 transitions. [2020-10-25 19:36:22,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2282 transitions. [2020-10-25 19:36:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-10-25 19:36:22,791 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:22,791 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:23,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-25 19:36:23,006 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:23,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1161393041, now seen corresponding path program 1 times [2020-10-25 19:36:23,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:23,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384101032] [2020-10-25 19:36:23,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:23,023 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-25 19:36:23,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837950064] [2020-10-25 19:36:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 19:36:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:23,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:36:23,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:36:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-25 19:36:23,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384101032] [2020-10-25 19:36:23,174 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-25 19:36:23,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837950064] [2020-10-25 19:36:23,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:23,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:23,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796101345] [2020-10-25 19:36:23,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:23,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:23,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:23,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:23,175 INFO L87 Difference]: Start difference. First operand 1438 states and 2282 transitions. Second operand 3 states. [2020-10-25 19:36:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:23,308 INFO L93 Difference]: Finished difference Result 2868 states and 4555 transitions. [2020-10-25 19:36:23,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:23,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2020-10-25 19:36:23,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:23,320 INFO L225 Difference]: With dead ends: 2868 [2020-10-25 19:36:23,321 INFO L226 Difference]: Without dead ends: 1806 [2020-10-25 19:36:23,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2020-10-25 19:36:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1806. [2020-10-25 19:36:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1806 states. [2020-10-25 19:36:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2866 transitions. [2020-10-25 19:36:23,424 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2866 transitions. Word has length 138 [2020-10-25 19:36:23,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:23,425 INFO L481 AbstractCegarLoop]: Abstraction has 1806 states and 2866 transitions. [2020-10-25 19:36:23,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2866 transitions. [2020-10-25 19:36:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-10-25 19:36:23,433 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:23,433 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:23,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-25 19:36:23,649 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:23,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash 230274424, now seen corresponding path program 1 times [2020-10-25 19:36:23,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:23,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620302481] [2020-10-25 19:36:23,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:23,674 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-25 19:36:23,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283679141] [2020-10-25 19:36:23,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 19:36:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:23,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:36:23,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:36:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-10-25 19:36:23,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620302481] [2020-10-25 19:36:23,856 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-25 19:36:23,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283679141] [2020-10-25 19:36:23,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:23,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:23,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282937696] [2020-10-25 19:36:23,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:23,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:23,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:23,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:23,859 INFO L87 Difference]: Start difference. First operand 1806 states and 2866 transitions. Second operand 3 states. [2020-10-25 19:36:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:24,204 INFO L93 Difference]: Finished difference Result 3649 states and 5775 transitions. [2020-10-25 19:36:24,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:24,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2020-10-25 19:36:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:24,217 INFO L225 Difference]: With dead ends: 3649 [2020-10-25 19:36:24,217 INFO L226 Difference]: Without dead ends: 1851 [2020-10-25 19:36:24,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2020-10-25 19:36:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1806. [2020-10-25 19:36:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1806 states. [2020-10-25 19:36:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2794 transitions. [2020-10-25 19:36:24,298 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2794 transitions. Word has length 199 [2020-10-25 19:36:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:24,298 INFO L481 AbstractCegarLoop]: Abstraction has 1806 states and 2794 transitions. [2020-10-25 19:36:24,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2794 transitions. [2020-10-25 19:36:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-10-25 19:36:24,304 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:24,304 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:24,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:36:24,519 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:24,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:24,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1368505586, now seen corresponding path program 1 times [2020-10-25 19:36:24,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:24,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776570463] [2020-10-25 19:36:24,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-10-25 19:36:24,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776570463] [2020-10-25 19:36:24,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:24,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:24,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559510666] [2020-10-25 19:36:24,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:24,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:24,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:24,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:24,631 INFO L87 Difference]: Start difference. First operand 1806 states and 2794 transitions. Second operand 3 states. [2020-10-25 19:36:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:24,999 INFO L93 Difference]: Finished difference Result 3666 states and 5648 transitions. [2020-10-25 19:36:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:25,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-10-25 19:36:25,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:25,010 INFO L225 Difference]: With dead ends: 3666 [2020-10-25 19:36:25,010 INFO L226 Difference]: Without dead ends: 1868 [2020-10-25 19:36:25,017 INFO L677 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 [2020-10-25 19:36:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2020-10-25 19:36:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1806. [2020-10-25 19:36:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1806 states. [2020-10-25 19:36:25,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2716 transitions. [2020-10-25 19:36:25,092 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2716 transitions. Word has length 212 [2020-10-25 19:36:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:25,092 INFO L481 AbstractCegarLoop]: Abstraction has 1806 states and 2716 transitions. [2020-10-25 19:36:25,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2716 transitions. [2020-10-25 19:36:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-10-25 19:36:25,101 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:25,101 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:25,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 19:36:25,101 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:25,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:25,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1759452965, now seen corresponding path program 1 times [2020-10-25 19:36:25,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:25,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907137250] [2020-10-25 19:36:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:25,121 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-25 19:36:25,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390676902] [2020-10-25 19:36:25,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 19:36:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:25,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:36:25,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:36:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-10-25 19:36:25,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907137250] [2020-10-25 19:36:25,380 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-25 19:36:25,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390676902] [2020-10-25 19:36:25,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:25,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:25,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457639473] [2020-10-25 19:36:25,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:25,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:25,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:25,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:25,385 INFO L87 Difference]: Start difference. First operand 1806 states and 2716 transitions. Second operand 3 states. [2020-10-25 19:36:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:25,770 INFO L93 Difference]: Finished difference Result 3844 states and 5780 transitions. [2020-10-25 19:36:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:25,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2020-10-25 19:36:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:25,782 INFO L225 Difference]: With dead ends: 3844 [2020-10-25 19:36:25,782 INFO L226 Difference]: Without dead ends: 1921 [2020-10-25 19:36:25,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2020-10-25 19:36:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1876. [2020-10-25 19:36:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2020-10-25 19:36:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2771 transitions. [2020-10-25 19:36:25,867 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2771 transitions. Word has length 241 [2020-10-25 19:36:25,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:25,868 INFO L481 AbstractCegarLoop]: Abstraction has 1876 states and 2771 transitions. [2020-10-25 19:36:25,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2771 transitions. [2020-10-25 19:36:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2020-10-25 19:36:25,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:25,877 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:26,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:36:26,092 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:26,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:26,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1825507112, now seen corresponding path program 1 times [2020-10-25 19:36:26,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:26,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806268495] [2020-10-25 19:36:26,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:26,126 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-25 19:36:26,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581159917] [2020-10-25 19:36:26,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:36:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:26,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:36:26,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:36:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2020-10-25 19:36:26,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806268495] [2020-10-25 19:36:26,343 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-25 19:36:26,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581159917] [2020-10-25 19:36:26,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:26,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:26,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630850850] [2020-10-25 19:36:26,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:26,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:26,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:26,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:26,350 INFO L87 Difference]: Start difference. First operand 1876 states and 2771 transitions. Second operand 3 states. [2020-10-25 19:36:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:26,746 INFO L93 Difference]: Finished difference Result 3789 states and 5585 transitions. [2020-10-25 19:36:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:26,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2020-10-25 19:36:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:26,763 INFO L225 Difference]: With dead ends: 3789 [2020-10-25 19:36:26,764 INFO L226 Difference]: Without dead ends: 1921 [2020-10-25 19:36:26,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2020-10-25 19:36:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1876. [2020-10-25 19:36:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2020-10-25 19:36:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2701 transitions. [2020-10-25 19:36:26,837 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2701 transitions. Word has length 255 [2020-10-25 19:36:26,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:26,838 INFO L481 AbstractCegarLoop]: Abstraction has 1876 states and 2701 transitions. [2020-10-25 19:36:26,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2701 transitions. [2020-10-25 19:36:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2020-10-25 19:36:26,845 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:26,845 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:27,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-10-25 19:36:27,060 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:27,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:27,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1622703552, now seen corresponding path program 1 times [2020-10-25 19:36:27,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:27,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999309481] [2020-10-25 19:36:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:27,077 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-25 19:36:27,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [539745486] [2020-10-25 19:36:27,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:36:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:27,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 19:36:27,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:36:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2020-10-25 19:36:27,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999309481] [2020-10-25 19:36:27,317 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-25 19:36:27,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539745486] [2020-10-25 19:36:27,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:27,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:27,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382658742] [2020-10-25 19:36:27,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:27,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:27,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:27,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:27,320 INFO L87 Difference]: Start difference. First operand 1876 states and 2701 transitions. Second operand 3 states. [2020-10-25 19:36:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:27,446 INFO L93 Difference]: Finished difference Result 5592 states and 8059 transitions. [2020-10-25 19:36:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:27,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2020-10-25 19:36:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:27,464 INFO L225 Difference]: With dead ends: 5592 [2020-10-25 19:36:27,465 INFO L226 Difference]: Without dead ends: 3724 [2020-10-25 19:36:27,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2020-10-25 19:36:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3722. [2020-10-25 19:36:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3722 states. [2020-10-25 19:36:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 5354 transitions. [2020-10-25 19:36:27,608 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 5354 transitions. Word has length 269 [2020-10-25 19:36:27,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:27,608 INFO L481 AbstractCegarLoop]: Abstraction has 3722 states and 5354 transitions. [2020-10-25 19:36:27,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5354 transitions. [2020-10-25 19:36:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2020-10-25 19:36:27,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:27,621 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2020-10-25 19:36:27,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:36:27,835 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:27,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:27,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1812515673, now seen corresponding path program 1 times [2020-10-25 19:36:27,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:27,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451298383] [2020-10-25 19:36:27,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2020-10-25 19:36:28,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451298383] [2020-10-25 19:36:28,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:28,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:28,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621275949] [2020-10-25 19:36:28,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:28,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:28,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:28,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:28,039 INFO L87 Difference]: Start difference. First operand 3722 states and 5354 transitions. Second operand 3 states. [2020-10-25 19:36:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:28,372 INFO L93 Difference]: Finished difference Result 7581 states and 10901 transitions. [2020-10-25 19:36:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:28,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2020-10-25 19:36:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:28,394 INFO L225 Difference]: With dead ends: 7581 [2020-10-25 19:36:28,394 INFO L226 Difference]: Without dead ends: 3867 [2020-10-25 19:36:28,400 INFO L677 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 [2020-10-25 19:36:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2020-10-25 19:36:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3837. [2020-10-25 19:36:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2020-10-25 19:36:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5494 transitions. [2020-10-25 19:36:28,552 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5494 transitions. Word has length 307 [2020-10-25 19:36:28,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:28,552 INFO L481 AbstractCegarLoop]: Abstraction has 3837 states and 5494 transitions. [2020-10-25 19:36:28,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5494 transitions. [2020-10-25 19:36:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2020-10-25 19:36:28,564 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:28,564 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2020-10-25 19:36:28,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-25 19:36:28,565 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:28,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1267987889, now seen corresponding path program 1 times [2020-10-25 19:36:28,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:28,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235903255] [2020-10-25 19:36:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:28,582 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-25 19:36:28,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2041477110] [2020-10-25 19:36:28,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:36:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:28,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:36:28,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:36:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2020-10-25 19:36:28,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235903255] [2020-10-25 19:36:28,799 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-25 19:36:28,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041477110] [2020-10-25 19:36:28,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:28,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:28,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066683627] [2020-10-25 19:36:28,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:28,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:28,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:28,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:28,801 INFO L87 Difference]: Start difference. First operand 3837 states and 5494 transitions. Second operand 3 states. [2020-10-25 19:36:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:29,085 INFO L93 Difference]: Finished difference Result 7666 states and 10976 transitions. [2020-10-25 19:36:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:29,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2020-10-25 19:36:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:29,103 INFO L225 Difference]: With dead ends: 7666 [2020-10-25 19:36:29,104 INFO L226 Difference]: Without dead ends: 2264 [2020-10-25 19:36:29,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2020-10-25 19:36:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2264. [2020-10-25 19:36:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2020-10-25 19:36:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 3184 transitions. [2020-10-25 19:36:29,184 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 3184 transitions. Word has length 320 [2020-10-25 19:36:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:29,184 INFO L481 AbstractCegarLoop]: Abstraction has 2264 states and 3184 transitions. [2020-10-25 19:36:29,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 3184 transitions. [2020-10-25 19:36:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-10-25 19:36:29,193 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:29,193 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2020-10-25 19:36:29,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-10-25 19:36:29,409 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:29,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:29,410 INFO L82 PathProgramCache]: Analyzing trace with hash 493001237, now seen corresponding path program 1 times [2020-10-25 19:36:29,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:29,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615506217] [2020-10-25 19:36:29,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-25 19:36:29,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615506217] [2020-10-25 19:36:29,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:29,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:29,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437445539] [2020-10-25 19:36:29,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:29,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:29,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:29,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:29,544 INFO L87 Difference]: Start difference. First operand 2264 states and 3184 transitions. Second operand 3 states. [2020-10-25 19:36:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:29,821 INFO L93 Difference]: Finished difference Result 4742 states and 6692 transitions. [2020-10-25 19:36:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:29,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2020-10-25 19:36:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:29,827 INFO L225 Difference]: With dead ends: 4742 [2020-10-25 19:36:29,827 INFO L226 Difference]: Without dead ends: 2486 [2020-10-25 19:36:29,830 INFO L677 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 [2020-10-25 19:36:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2020-10-25 19:36:29,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2414. [2020-10-25 19:36:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2414 states. [2020-10-25 19:36:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3364 transitions. [2020-10-25 19:36:29,901 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3364 transitions. Word has length 327 [2020-10-25 19:36:29,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:29,901 INFO L481 AbstractCegarLoop]: Abstraction has 2414 states and 3364 transitions. [2020-10-25 19:36:29,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3364 transitions. [2020-10-25 19:36:29,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2020-10-25 19:36:29,907 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:29,908 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2020-10-25 19:36:29,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-25 19:36:29,908 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:29,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:29,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1757399063, now seen corresponding path program 1 times [2020-10-25 19:36:29,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:29,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738870185] [2020-10-25 19:36:29,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2020-10-25 19:36:30,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738870185] [2020-10-25 19:36:30,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:30,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:30,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830931874] [2020-10-25 19:36:30,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:30,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:30,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:30,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:30,068 INFO L87 Difference]: Start difference. First operand 2414 states and 3364 transitions. Second operand 3 states. [2020-10-25 19:36:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:30,375 INFO L93 Difference]: Finished difference Result 4862 states and 6788 transitions. [2020-10-25 19:36:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:30,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2020-10-25 19:36:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:30,382 INFO L225 Difference]: With dead ends: 4862 [2020-10-25 19:36:30,383 INFO L226 Difference]: Without dead ends: 2456 [2020-10-25 19:36:30,387 INFO L677 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 [2020-10-25 19:36:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2020-10-25 19:36:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2414. [2020-10-25 19:36:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2414 states. [2020-10-25 19:36:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3316 transitions. [2020-10-25 19:36:30,476 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3316 transitions. Word has length 353 [2020-10-25 19:36:30,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:30,476 INFO L481 AbstractCegarLoop]: Abstraction has 2414 states and 3316 transitions. [2020-10-25 19:36:30,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3316 transitions. [2020-10-25 19:36:30,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2020-10-25 19:36:30,484 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:30,484 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2020-10-25 19:36:30,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-25 19:36:30,485 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:30,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:30,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1876884711, now seen corresponding path program 1 times [2020-10-25 19:36:30,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:30,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164821605] [2020-10-25 19:36:30,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-25 19:36:30,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164821605] [2020-10-25 19:36:30,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990463190] [2020-10-25 19:36:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:36:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:30,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 19:36:30,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:36:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-25 19:36:30,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:36:30,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-25 19:36:30,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225398640] [2020-10-25 19:36:30,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:36:30,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:30,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:36:30,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:36:30,915 INFO L87 Difference]: Start difference. First operand 2414 states and 3316 transitions. Second operand 4 states. [2020-10-25 19:36:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:31,589 INFO L93 Difference]: Finished difference Result 7028 states and 9640 transitions. [2020-10-25 19:36:31,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 19:36:31,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2020-10-25 19:36:31,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:31,599 INFO L225 Difference]: With dead ends: 7028 [2020-10-25 19:36:31,600 INFO L226 Difference]: Without dead ends: 4476 [2020-10-25 19:36:31,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:36:31,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2020-10-25 19:36:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 2486. [2020-10-25 19:36:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2020-10-25 19:36:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3374 transitions. [2020-10-25 19:36:31,690 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3374 transitions. Word has length 370 [2020-10-25 19:36:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:31,690 INFO L481 AbstractCegarLoop]: Abstraction has 2486 states and 3374 transitions. [2020-10-25 19:36:31,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:36:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3374 transitions. [2020-10-25 19:36:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2020-10-25 19:36:31,698 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:31,698 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2020-10-25 19:36:31,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-10-25 19:36:31,912 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:31,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:31,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1628763683, now seen corresponding path program 1 times [2020-10-25 19:36:31,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:31,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901454260] [2020-10-25 19:36:31,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2020-10-25 19:36:32,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901454260] [2020-10-25 19:36:32,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:32,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:32,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971782568] [2020-10-25 19:36:32,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:32,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:32,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:32,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:32,091 INFO L87 Difference]: Start difference. First operand 2486 states and 3374 transitions. Second operand 3 states. [2020-10-25 19:36:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:32,403 INFO L93 Difference]: Finished difference Result 4976 states and 6748 transitions. [2020-10-25 19:36:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:32,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2020-10-25 19:36:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:32,409 INFO L225 Difference]: With dead ends: 4976 [2020-10-25 19:36:32,409 INFO L226 Difference]: Without dead ends: 2498 [2020-10-25 19:36:32,413 INFO L677 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 [2020-10-25 19:36:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2020-10-25 19:36:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2486. [2020-10-25 19:36:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2020-10-25 19:36:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3326 transitions. [2020-10-25 19:36:32,488 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3326 transitions. Word has length 438 [2020-10-25 19:36:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:32,488 INFO L481 AbstractCegarLoop]: Abstraction has 2486 states and 3326 transitions. [2020-10-25 19:36:32,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3326 transitions. [2020-10-25 19:36:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2020-10-25 19:36:32,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:32,495 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2020-10-25 19:36:32,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-25 19:36:32,495 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:32,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:32,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1752367566, now seen corresponding path program 1 times [2020-10-25 19:36:32,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:32,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541715568] [2020-10-25 19:36:32,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2020-10-25 19:36:32,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541715568] [2020-10-25 19:36:32,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:32,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:32,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321096831] [2020-10-25 19:36:32,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:32,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:32,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:32,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:32,763 INFO L87 Difference]: Start difference. First operand 2486 states and 3326 transitions. Second operand 3 states. [2020-10-25 19:36:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:33,127 INFO L93 Difference]: Finished difference Result 5180 states and 6946 transitions. [2020-10-25 19:36:33,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:33,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2020-10-25 19:36:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:33,134 INFO L225 Difference]: With dead ends: 5180 [2020-10-25 19:36:33,135 INFO L226 Difference]: Without dead ends: 2702 [2020-10-25 19:36:33,138 INFO L677 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 [2020-10-25 19:36:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2020-10-25 19:36:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2690. [2020-10-25 19:36:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2020-10-25 19:36:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3560 transitions. [2020-10-25 19:36:33,258 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 3560 transitions. Word has length 470 [2020-10-25 19:36:33,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:33,261 INFO L481 AbstractCegarLoop]: Abstraction has 2690 states and 3560 transitions. [2020-10-25 19:36:33,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:33,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3560 transitions. [2020-10-25 19:36:33,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2020-10-25 19:36:33,275 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:33,275 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:36:33,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-25 19:36:33,278 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:33,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:33,279 INFO L82 PathProgramCache]: Analyzing trace with hash -742298620, now seen corresponding path program 1 times [2020-10-25 19:36:33,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:33,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251099578] [2020-10-25 19:36:33,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2020-10-25 19:36:33,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251099578] [2020-10-25 19:36:33,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:36:33,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:36:33,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538735620] [2020-10-25 19:36:33,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:36:33,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:33,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:36:33,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:36:33,556 INFO L87 Difference]: Start difference. First operand 2690 states and 3560 transitions. Second operand 3 states. [2020-10-25 19:36:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:33,895 INFO L93 Difference]: Finished difference Result 5600 states and 7438 transitions. [2020-10-25 19:36:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:36:33,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 532 [2020-10-25 19:36:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:33,902 INFO L225 Difference]: With dead ends: 5600 [2020-10-25 19:36:33,902 INFO L226 Difference]: Without dead ends: 2918 [2020-10-25 19:36:33,905 INFO L677 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 [2020-10-25 19:36:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-10-25 19:36:33,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2906. [2020-10-25 19:36:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2906 states. [2020-10-25 19:36:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 3806 transitions. [2020-10-25 19:36:33,987 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 3806 transitions. Word has length 532 [2020-10-25 19:36:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:33,987 INFO L481 AbstractCegarLoop]: Abstraction has 2906 states and 3806 transitions. [2020-10-25 19:36:33,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:36:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 3806 transitions. [2020-10-25 19:36:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2020-10-25 19:36:33,994 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:36:33,995 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-25 19:36:33,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-25 19:36:33,995 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:36:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:36:33,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1835374162, now seen corresponding path program 1 times [2020-10-25 19:36:33,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:36:33,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086678347] [2020-10-25 19:36:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:36:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2020-10-25 19:36:34,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086678347] [2020-10-25 19:36:34,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767808098] [2020-10-25 19:36:34,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:36:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:36:34,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 19:36:34,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:36:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2020-10-25 19:36:34,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:36:34,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-10-25 19:36:34,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020766332] [2020-10-25 19:36:34,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 19:36:34,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:36:34,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 19:36:34,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 19:36:34,834 INFO L87 Difference]: Start difference. First operand 2906 states and 3806 transitions. Second operand 6 states. [2020-10-25 19:36:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:36:35,243 INFO L93 Difference]: Finished difference Result 4541 states and 5954 transitions. [2020-10-25 19:36:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:36:35,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 598 [2020-10-25 19:36:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:36:35,246 INFO L225 Difference]: With dead ends: 4541 [2020-10-25 19:36:35,246 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 19:36:35,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-25 19:36:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 19:36:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 19:36:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 19:36:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 19:36:35,252 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2020-10-25 19:36:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:36:35,252 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 19:36:35,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 19:36:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 19:36:35,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 19:36:35,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:36:35,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 19:36:35,794 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 85 [2020-10-25 19:36:36,298 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2020-10-25 19:36:36,530 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 85 [2020-10-25 19:36:36,947 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2020-10-25 19:36:37,431 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-10-25 19:36:38,289 WARN L193 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2020-10-25 19:36:38,780 WARN L193 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-10-25 19:36:39,264 WARN L193 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-10-25 19:36:39,688 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 24 [2020-10-25 19:36:39,890 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2020-10-25 19:36:40,070 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 10 [2020-10-25 19:36:40,602 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-10-25 19:36:41,150 WARN L193 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2020-10-25 19:36:41,595 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2020-10-25 19:36:42,086 WARN L193 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-10-25 19:36:42,624 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-10-25 19:36:42,729 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 16 [2020-10-25 19:36:43,272 WARN L193 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-10-25 19:36:43,726 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2020-10-25 19:36:44,287 WARN L193 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-10-25 19:36:45,689 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2020-10-25 19:36:46,169 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2020-10-25 19:36:47,177 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2020-10-25 19:36:47,801 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-10-25 19:36:48,304 WARN L193 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2020-10-25 19:36:48,308 INFO L274 CegarLoopResult]: For program point L663(lines 663 667) no Hoare annotation was computed. [2020-10-25 19:36:48,309 INFO L274 CegarLoopResult]: For program point L630(lines 630 639) no Hoare annotation was computed. [2020-10-25 19:36:48,310 INFO L274 CegarLoopResult]: For program point L663-2(lines 663 667) no Hoare annotation was computed. [2020-10-25 19:36:48,311 INFO L274 CegarLoopResult]: For program point L630-2(lines 629 651) no Hoare annotation was computed. [2020-10-25 19:36:48,312 INFO L270 CegarLoopResult]: At program point L399(lines 390 421) the Hoare annotation is: (let ((.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse5 .cse0 .cse6 .cse1 .cse2 .cse3 .cse8 .cse4 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse5 .cse0 .cse6 .cse1 .cse2 .cse3 .cse8 .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse7))) [2020-10-25 19:36:48,313 INFO L270 CegarLoopResult]: At program point L168(lines 167 606) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse3 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3 .cse1 .cse2))) [2020-10-25 19:36:48,313 INFO L270 CegarLoopResult]: At program point L135(lines 128 619) the Hoare annotation is: (let ((.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse3 .cse4 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2020-10-25 19:36:48,313 INFO L274 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2020-10-25 19:36:48,313 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-25 19:36:48,313 INFO L274 CegarLoopResult]: For program point L367(lines 367 371) no Hoare annotation was computed. [2020-10-25 19:36:48,313 INFO L274 CegarLoopResult]: For program point L632(lines 632 636) no Hoare annotation was computed. [2020-10-25 19:36:48,313 INFO L274 CegarLoopResult]: For program point L401(lines 401 407) no Hoare annotation was computed. [2020-10-25 19:36:48,314 INFO L274 CegarLoopResult]: For program point L203(lines 203 594) no Hoare annotation was computed. [2020-10-25 19:36:48,314 INFO L274 CegarLoopResult]: For program point L170(lines 170 605) no Hoare annotation was computed. [2020-10-25 19:36:48,314 INFO L274 CegarLoopResult]: For program point L137(lines 137 616) no Hoare annotation was computed. [2020-10-25 19:36:48,314 INFO L274 CegarLoopResult]: For program point L104(lines 104 627) no Hoare annotation was computed. [2020-10-25 19:36:48,314 INFO L274 CegarLoopResult]: For program point L468(lines 468 472) no Hoare annotation was computed. [2020-10-25 19:36:48,314 INFO L270 CegarLoopResult]: At program point L204(lines 200 595) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) [2020-10-25 19:36:48,314 INFO L270 CegarLoopResult]: At program point L105(lines 104 627) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) [2020-10-25 19:36:48,314 INFO L274 CegarLoopResult]: For program point L503(lines 503 507) no Hoare annotation was computed. [2020-10-25 19:36:48,314 INFO L274 CegarLoopResult]: For program point L503-2(lines 211 589) no Hoare annotation was computed. [2020-10-25 19:36:48,314 INFO L274 CegarLoopResult]: For program point L239(lines 239 244) no Hoare annotation was computed. [2020-10-25 19:36:48,315 INFO L274 CegarLoopResult]: For program point L206(lines 206 593) no Hoare annotation was computed. [2020-10-25 19:36:48,315 INFO L274 CegarLoopResult]: For program point L173(lines 173 604) no Hoare annotation was computed. [2020-10-25 19:36:48,315 INFO L274 CegarLoopResult]: For program point L140(lines 140 615) no Hoare annotation was computed. [2020-10-25 19:36:48,315 INFO L274 CegarLoopResult]: For program point L107(lines 107 626) no Hoare annotation was computed. [2020-10-25 19:36:48,315 INFO L270 CegarLoopResult]: At program point L207(lines 206 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2020-10-25 19:36:48,315 INFO L270 CegarLoopResult]: At program point L174(lines 170 605) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse9 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse10 .cse11 .cse12 .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2020-10-25 19:36:48,315 INFO L270 CegarLoopResult]: At program point L141(lines 137 616) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse1 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse8))) [2020-10-25 19:36:48,316 INFO L274 CegarLoopResult]: For program point L75(lines 75 83) no Hoare annotation was computed. [2020-10-25 19:36:48,316 INFO L274 CegarLoopResult]: For program point L274(lines 274 278) no Hoare annotation was computed. [2020-10-25 19:36:48,316 INFO L274 CegarLoopResult]: For program point L308(lines 308 312) no Hoare annotation was computed. [2020-10-25 19:36:48,316 INFO L274 CegarLoopResult]: For program point L308-2(lines 211 589) no Hoare annotation was computed. [2020-10-25 19:36:48,316 INFO L274 CegarLoopResult]: For program point L176(lines 176 603) no Hoare annotation was computed. [2020-10-25 19:36:48,316 INFO L274 CegarLoopResult]: For program point L143(lines 143 614) no Hoare annotation was computed. [2020-10-25 19:36:48,316 INFO L274 CegarLoopResult]: For program point L110(lines 110 625) no Hoare annotation was computed. [2020-10-25 19:36:48,317 INFO L274 CegarLoopResult]: For program point L573(lines 573 583) no Hoare annotation was computed. [2020-10-25 19:36:48,317 INFO L274 CegarLoopResult]: For program point L573-1(lines 573 583) no Hoare annotation was computed. [2020-10-25 19:36:48,317 INFO L274 CegarLoopResult]: For program point L441-1(lines 441 453) no Hoare annotation was computed. [2020-10-25 19:36:48,317 INFO L270 CegarLoopResult]: At program point L210(lines 209 592) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2020-10-25 19:36:48,317 INFO L274 CegarLoopResult]: For program point L78(lines 78 82) no Hoare annotation was computed. [2020-10-25 19:36:48,317 INFO L274 CegarLoopResult]: For program point L78-2(lines 75 83) no Hoare annotation was computed. [2020-10-25 19:36:48,317 INFO L270 CegarLoopResult]: At program point L409(lines 400 420) the Hoare annotation is: (let ((.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse5 .cse0 .cse6 .cse1 .cse2 .cse3 .cse8 .cse4 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse5 .cse0 .cse6 .cse1 .cse2 .cse3 .cse8 .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse7))) [2020-10-25 19:36:48,317 INFO L274 CegarLoopResult]: For program point L343(lines 343 347) no Hoare annotation was computed. [2020-10-25 19:36:48,317 INFO L274 CegarLoopResult]: For program point L343-2(lines 211 589) no Hoare annotation was computed. [2020-10-25 19:36:48,318 INFO L277 CegarLoopResult]: At program point L674(lines 66 676) the Hoare annotation is: true [2020-10-25 19:36:48,318 INFO L274 CegarLoopResult]: For program point L641(lines 641 647) no Hoare annotation was computed. [2020-10-25 19:36:48,318 INFO L274 CegarLoopResult]: For program point L542(lines 542 547) no Hoare annotation was computed. [2020-10-25 19:36:48,318 INFO L274 CegarLoopResult]: For program point L179(lines 179 602) no Hoare annotation was computed. [2020-10-25 19:36:48,318 INFO L274 CegarLoopResult]: For program point L146(lines 146 613) no Hoare annotation was computed. [2020-10-25 19:36:48,318 INFO L274 CegarLoopResult]: For program point L113(lines 113 624) no Hoare annotation was computed. [2020-10-25 19:36:48,318 INFO L277 CegarLoopResult]: At program point L675(lines 11 677) the Hoare annotation is: true [2020-10-25 19:36:48,318 INFO L274 CegarLoopResult]: For program point L576(lines 576 580) no Hoare annotation was computed. [2020-10-25 19:36:48,318 INFO L274 CegarLoopResult]: For program point L444(lines 444 449) no Hoare annotation was computed. [2020-10-25 19:36:48,318 INFO L270 CegarLoopResult]: At program point L180(lines 176 603) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse9 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse10 .cse11 .cse12 .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2020-10-25 19:36:48,319 INFO L270 CegarLoopResult]: At program point L147(lines 143 614) the Hoare annotation is: (let ((.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse3 .cse4 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2020-10-25 19:36:48,319 INFO L274 CegarLoopResult]: For program point L412(lines 412 416) no Hoare annotation was computed. [2020-10-25 19:36:48,319 INFO L270 CegarLoopResult]: At program point L214(lines 107 626) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse3 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse4 .cse5 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse10))) [2020-10-25 19:36:48,319 INFO L274 CegarLoopResult]: For program point L182(lines 182 601) no Hoare annotation was computed. [2020-10-25 19:36:48,319 INFO L274 CegarLoopResult]: For program point L149(lines 149 612) no Hoare annotation was computed. [2020-10-25 19:36:48,319 INFO L274 CegarLoopResult]: For program point L116(lines 116 623) no Hoare annotation was computed. [2020-10-25 19:36:48,320 INFO L274 CegarLoopResult]: For program point L513(lines 513 517) no Hoare annotation was computed. [2020-10-25 19:36:48,320 INFO L274 CegarLoopResult]: For program point L480(lines 480 484) no Hoare annotation was computed. [2020-10-25 19:36:48,320 INFO L274 CegarLoopResult]: For program point L513-2(lines 513 517) no Hoare annotation was computed. [2020-10-25 19:36:48,320 INFO L274 CegarLoopResult]: For program point L85(lines 85 93) no Hoare annotation was computed. [2020-10-25 19:36:48,320 INFO L274 CegarLoopResult]: For program point L85-1(lines 66 676) no Hoare annotation was computed. [2020-10-25 19:36:48,320 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 19:36:48,321 INFO L274 CegarLoopResult]: For program point L185(lines 185 600) no Hoare annotation was computed. [2020-10-25 19:36:48,321 INFO L274 CegarLoopResult]: For program point L152(lines 152 611) no Hoare annotation was computed. [2020-10-25 19:36:48,321 INFO L274 CegarLoopResult]: For program point L119(lines 119 622) no Hoare annotation was computed. [2020-10-25 19:36:48,321 INFO L274 CegarLoopResult]: For program point L86(lines 86 90) no Hoare annotation was computed. [2020-10-25 19:36:48,321 INFO L274 CegarLoopResult]: For program point L351(lines 351 382) no Hoare annotation was computed. [2020-10-25 19:36:48,321 INFO L274 CegarLoopResult]: For program point L318(lines 318 322) no Hoare annotation was computed. [2020-10-25 19:36:48,322 INFO L274 CegarLoopResult]: For program point L318-2(lines 318 322) no Hoare annotation was computed. [2020-10-25 19:36:48,322 INFO L274 CegarLoopResult]: For program point L219(lines 219 223) no Hoare annotation was computed. [2020-10-25 19:36:48,322 INFO L270 CegarLoopResult]: At program point L186(lines 182 601) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse9 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse10 .cse11 .cse12 .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2020-10-25 19:36:48,322 INFO L270 CegarLoopResult]: At program point L153(lines 149 612) the Hoare annotation is: (let ((.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse3 .cse4 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2020-10-25 19:36:48,323 INFO L274 CegarLoopResult]: For program point L219-2(lines 211 589) no Hoare annotation was computed. [2020-10-25 19:36:48,323 INFO L274 CegarLoopResult]: For program point L188(lines 188 599) no Hoare annotation was computed. [2020-10-25 19:36:48,323 INFO L274 CegarLoopResult]: For program point L155(lines 155 610) no Hoare annotation was computed. [2020-10-25 19:36:48,323 INFO L274 CegarLoopResult]: For program point L122(lines 122 621) no Hoare annotation was computed. [2020-10-25 19:36:48,323 INFO L274 CegarLoopResult]: For program point L552(lines 552 556) no Hoare annotation was computed. [2020-10-25 19:36:48,323 INFO L274 CegarLoopResult]: For program point L354(lines 354 381) no Hoare annotation was computed. [2020-10-25 19:36:48,324 INFO L274 CegarLoopResult]: For program point L354-1(lines 354 381) no Hoare annotation was computed. [2020-10-25 19:36:48,324 INFO L270 CegarLoopResult]: At program point L123(lines 119 622) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2020-10-25 19:36:48,324 INFO L270 CegarLoopResult]: At program point L553(lines 66 676) the Hoare annotation is: false [2020-10-25 19:36:48,324 INFO L274 CegarLoopResult]: For program point L355(lines 355 378) no Hoare annotation was computed. [2020-10-25 19:36:48,324 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 19:36:48,325 INFO L274 CegarLoopResult]: For program point L256(lines 256 268) no Hoare annotation was computed. [2020-10-25 19:36:48,325 INFO L274 CegarLoopResult]: For program point L257(lines 257 262) no Hoare annotation was computed. [2020-10-25 19:36:48,325 INFO L274 CegarLoopResult]: For program point L191(lines 191 598) no Hoare annotation was computed. [2020-10-25 19:36:48,325 INFO L274 CegarLoopResult]: For program point L158(lines 158 609) no Hoare annotation was computed. [2020-10-25 19:36:48,325 INFO L274 CegarLoopResult]: For program point L125(lines 125 620) no Hoare annotation was computed. [2020-10-25 19:36:48,325 INFO L277 CegarLoopResult]: At program point L687(lines 678 689) the Hoare annotation is: true [2020-10-25 19:36:48,326 INFO L274 CegarLoopResult]: For program point L390(lines 390 421) no Hoare annotation was computed. [2020-10-25 19:36:48,326 INFO L274 CegarLoopResult]: For program point L291(lines 291 295) no Hoare annotation was computed. [2020-10-25 19:36:48,326 INFO L274 CegarLoopResult]: For program point L291-2(lines 211 589) no Hoare annotation was computed. [2020-10-25 19:36:48,326 INFO L270 CegarLoopResult]: At program point L192(lines 188 599) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse9 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse12 .cse13))) [2020-10-25 19:36:48,327 INFO L270 CegarLoopResult]: At program point L159(lines 155 610) the Hoare annotation is: (let ((.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse5 .cse0 .cse6 .cse1 .cse2 .cse3 .cse8 .cse4 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse5 .cse0 .cse6 .cse1 .cse2 .cse3 .cse8 .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse7))) [2020-10-25 19:36:48,327 INFO L270 CegarLoopResult]: At program point L126(lines 125 620) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) [2020-10-25 19:36:48,327 INFO L274 CegarLoopResult]: For program point L523(lines 523 528) no Hoare annotation was computed. [2020-10-25 19:36:48,327 INFO L274 CegarLoopResult]: For program point L391(lines 391 397) no Hoare annotation was computed. [2020-10-25 19:36:48,327 INFO L274 CegarLoopResult]: For program point L358(lines 358 377) no Hoare annotation was computed. [2020-10-25 19:36:48,328 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 19:36:48,328 INFO L270 CegarLoopResult]: At program point L590(lines 101 658) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse11 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse2 .cse3 .cse12) (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse4) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) .cse11) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) [2020-10-25 19:36:48,328 INFO L274 CegarLoopResult]: For program point L557(lines 557 561) no Hoare annotation was computed. [2020-10-25 19:36:48,328 INFO L274 CegarLoopResult]: For program point L491(lines 491 495) no Hoare annotation was computed. [2020-10-25 19:36:48,329 INFO L274 CegarLoopResult]: For program point L359(lines 359 363) no Hoare annotation was computed. [2020-10-25 19:36:48,329 INFO L274 CegarLoopResult]: For program point L359-2(lines 358 375) no Hoare annotation was computed. [2020-10-25 19:36:48,329 INFO L274 CegarLoopResult]: For program point L194(lines 194 597) no Hoare annotation was computed. [2020-10-25 19:36:48,329 INFO L274 CegarLoopResult]: For program point L161(lines 161 608) no Hoare annotation was computed. [2020-10-25 19:36:48,329 INFO L274 CegarLoopResult]: For program point L128(lines 128 619) no Hoare annotation was computed. [2020-10-25 19:36:48,329 INFO L274 CegarLoopResult]: For program point L459(lines 459 463) no Hoare annotation was computed. [2020-10-25 19:36:48,329 INFO L274 CegarLoopResult]: For program point L327-1(lines 327 336) no Hoare annotation was computed. [2020-10-25 19:36:48,330 INFO L277 CegarLoopResult]: At program point L659(lines 100 660) the Hoare annotation is: true [2020-10-25 19:36:48,330 INFO L274 CegarLoopResult]: For program point L197(lines 197 596) no Hoare annotation was computed. [2020-10-25 19:36:48,330 INFO L274 CegarLoopResult]: For program point L164(lines 164 607) no Hoare annotation was computed. [2020-10-25 19:36:48,330 INFO L274 CegarLoopResult]: For program point L131(lines 131 618) no Hoare annotation was computed. [2020-10-25 19:36:48,330 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 19:36:48,331 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 19:36:48,331 INFO L274 CegarLoopResult]: For program point L231(lines 231 248) no Hoare annotation was computed. [2020-10-25 19:36:48,331 INFO L270 CegarLoopResult]: At program point L198(lines 194 597) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse4 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse9 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12))) [2020-10-25 19:36:48,331 INFO L270 CegarLoopResult]: At program point L165(lines 161 608) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse4 .cse1 .cse5 .cse6 .cse2 .cse8 .cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse7) (and .cse0 .cse4 .cse1 .cse5 .cse6 .cse2 .cse8 .cse3 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2020-10-25 19:36:48,332 INFO L274 CegarLoopResult]: For program point L231-2(lines 211 589) no Hoare annotation was computed. [2020-10-25 19:36:48,332 INFO L274 CegarLoopResult]: For program point L628(lines 628 656) no Hoare annotation was computed. [2020-10-25 19:36:48,332 INFO L274 CegarLoopResult]: For program point L331(lines 331 335) no Hoare annotation was computed. [2020-10-25 19:36:48,332 INFO L274 CegarLoopResult]: For program point L629(lines 629 653) no Hoare annotation was computed. [2020-10-25 19:36:48,332 INFO L274 CegarLoopResult]: For program point L563(lines 563 567) no Hoare annotation was computed. [2020-10-25 19:36:48,332 INFO L274 CegarLoopResult]: For program point L530(lines 530 534) no Hoare annotation was computed. [2020-10-25 19:36:48,333 INFO L274 CegarLoopResult]: For program point L563-2(lines 563 567) no Hoare annotation was computed. [2020-10-25 19:36:48,333 INFO L274 CegarLoopResult]: For program point L464(lines 464 475) no Hoare annotation was computed. [2020-10-25 19:36:48,333 INFO L274 CegarLoopResult]: For program point L530-2(lines 211 589) no Hoare annotation was computed. [2020-10-25 19:36:48,333 INFO L274 CegarLoopResult]: For program point L431(lines 431 435) no Hoare annotation was computed. [2020-10-25 19:36:48,333 INFO L270 CegarLoopResult]: At program point L365(lines 348 383) the Hoare annotation is: (let ((.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse3 .cse4 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2020-10-25 19:36:48,334 INFO L274 CegarLoopResult]: For program point L233(lines 233 238) no Hoare annotation was computed. [2020-10-25 19:36:48,334 INFO L274 CegarLoopResult]: For program point L200(lines 200 595) no Hoare annotation was computed. [2020-10-25 19:36:48,334 INFO L274 CegarLoopResult]: For program point L167(lines 167 606) no Hoare annotation was computed. [2020-10-25 19:36:48,334 INFO L274 CegarLoopResult]: For program point L134(lines 134 617) no Hoare annotation was computed. [2020-10-25 19:36:48,334 INFO L270 CegarLoopResult]: At program point L101-2(lines 101 658) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse11 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse2 .cse3 .cse12) (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse4) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) .cse11) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) [2020-10-25 19:36:48,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:36:48 BoogieIcfgContainer [2020-10-25 19:36:48,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:36:48,416 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:36:48,416 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:36:48,416 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:36:48,417 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:36:16" (3/4) ... [2020-10-25 19:36:48,420 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 19:36:48,439 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-10-25 19:36:48,441 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-25 19:36:48,441 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 19:36:48,442 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 19:36:48,579 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 19:36:48,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:36:48,580 INFO L168 Benchmark]: Toolchain (without parser) took 34158.97 ms. Allocated memory was 41.9 MB in the beginning and 857.7 MB in the end (delta: 815.8 MB). Free memory was 17.4 MB in the beginning and 395.0 MB in the end (delta: -377.6 MB). Peak memory consumption was 440.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:36:48,581 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 41.9 MB. Free memory is still 26.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:36:48,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.57 ms. Allocated memory is still 52.4 MB. Free memory was 36.0 MB in the beginning and 32.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. [2020-10-25 19:36:48,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.91 ms. Allocated memory is still 52.4 MB. Free memory was 32.6 MB in the beginning and 29.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:36:48,582 INFO L168 Benchmark]: Boogie Preprocessor took 78.69 ms. Allocated memory is still 52.4 MB. Free memory was 29.8 MB in the beginning and 27.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:36:48,583 INFO L168 Benchmark]: RCFGBuilder took 912.44 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 27.5 MB in the beginning and 42.4 MB in the end (delta: -14.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:36:48,583 INFO L168 Benchmark]: TraceAbstraction took 32356.05 ms. Allocated memory was 62.9 MB in the beginning and 857.7 MB in the end (delta: 794.8 MB). Free memory was 42.0 MB in the beginning and 407.6 MB in the end (delta: -365.6 MB). Peak memory consumption was 521.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:36:48,583 INFO L168 Benchmark]: Witness Printer took 163.73 ms. Allocated memory is still 857.7 MB. Free memory was 407.6 MB in the beginning and 395.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-25 19:36:48,587 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 41.9 MB. Free memory is still 26.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 527.57 ms. Allocated memory is still 52.4 MB. Free memory was 36.0 MB in the beginning and 32.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 89.91 ms. Allocated memory is still 52.4 MB. Free memory was 32.6 MB in the beginning and 29.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 78.69 ms. Allocated memory is still 52.4 MB. Free memory was 29.8 MB in the beginning and 27.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 912.44 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 27.5 MB in the beginning and 42.4 MB in the end (delta: -14.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 32356.05 ms. Allocated memory was 62.9 MB in the beginning and 857.7 MB in the end (delta: 794.8 MB). Free memory was 42.0 MB in the beginning and 407.6 MB in the end (delta: -365.6 MB). Peak memory consumption was 521.1 MB. Max. memory is 16.1 GB. * Witness Printer took 163.73 ms. Allocated memory is still 857.7 MB. Free memory was 407.6 MB in the beginning and 395.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 400]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) || (((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && blastFlag <= 1) && !(s__state == 8481)) - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) || ((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8656))) || (((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 3 && s__state <= 8672) && 8672 <= s__state) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && 2 == blastFlag)) || (((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && blastFlag <= 1) && !(s__state == 8481))) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag <= 1)) || (((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (blastFlag <= 3 && !(s__hit == 0))) || (((3 == s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && 8448 <= s__state)) || s__state <= 3 - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && blastFlag <= 1) && !(s__state == 8481)) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && blastFlag <= 1) && !(s__state == 8481)) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && 8448 <= s__state) && 2 == blastFlag) || (((blastFlag <= 3 && s__state <= 8448) && 8448 <= s__state) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && 8448 <= s__state) && blastFlag <= 1)) || (((3 == s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && 8448 <= s__state) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && blastFlag <= 1) && !(s__state == 8481)) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) - InvariantResult [Line: 678]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8545) && s__state <= 8672) && !(s__state == 8480)) && !(8497 == s__state)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) || (((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && blastFlag <= 1) && !(s__state == 8481))) || (((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8545) && s__s3__tmp__next_state___0 <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) || ((((((((((!(s__state == 8545) && s__s3__tmp__next_state___0 <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && blastFlag <= 1)) || (((((((((((((!(s__state == 8545) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8656)) && !(s__hit == 0)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && s__state <= 8672) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && blastFlag <= 1) && !(s__state == 8481)) || ((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && s__state <= 8672) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__hit == 0))) || (((((((((((((!(s__state == 8545) && !(s__state == 8673)) && s__state <= 8672) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && 8448 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && blastFlag <= 1) && !(s__state == 8481)) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(s__hit == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) || ((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8656))) || (((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) || (((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && blastFlag <= 1) && !(s__state == 8481)) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) || ((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0))) || ((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8656)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) && 2 == blastFlag) || ((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0))) || (((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && blastFlag <= 1) && !(s__state == 8481)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag) || (((((((((((((!(s__state == 8545) && s__state <= 8672) && !(s__state == 8480)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0))) || (((((((((!(s__state == 8545) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && blastFlag <= 1) && !(s__state == 8481)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 3 && s__state <= 8672) && 8672 <= s__state) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && 2 == blastFlag)) || (((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && blastFlag <= 1) && !(s__state == 8481))) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag <= 1)) || (((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (blastFlag <= 3 && !(s__hit == 0))) || (((3 == s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && 8448 <= s__state)) || s__state <= 3 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) || ((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8656))) || (((((((((((((((!(s__state == 8545) && !(s__state == 8480)) && s__state <= 8672) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && 8448 <= s__state) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) || (((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && blastFlag <= 1) && !(s__state == 8481)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 19.3s, OverallIterations: 32, TraceHistogramMax: 19, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5562 SDtfs, 3443 SDslu, 2677 SDs, 0 SdLazy, 3059 SolverSat, 910 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2584 GetRequests, 2546 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3837occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 2417 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 367 NumberOfFragments, 2859 HoareAnnotationTreeSize, 29 FomulaSimplifications, 43835 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6830 FormulaSimplificationTreeSizeReductionInter, 11.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 7563 NumberOfCodeBlocks, 7563 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 7529 ConstructedInterpolants, 0 QuantifiedInterpolants, 3182748 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4312 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 34 InterpolantComputations, 30 PerfectInterpolantSequences, 25706/25810 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...