./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/openssl-simplified/s3_srvr_3.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 5f4304a957668929d4c4ca97a168406535fe955ba86c164574a4a7768919c53b --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 21:59:14,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 21:59:14,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 21:59:14,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 21:59:14,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 21:59:14,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 21:59:14,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 21:59:14,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 21:59:14,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 21:59:14,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 21:59:14,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 21:59:14,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 21:59:14,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 21:59:14,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 21:59:14,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 21:59:14,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 21:59:14,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 21:59:14,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 21:59:14,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 21:59:14,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 21:59:14,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 21:59:14,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 21:59:14,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 21:59:14,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 21:59:14,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 21:59:14,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 21:59:14,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 21:59:14,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 21:59:14,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 21:59:14,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 21:59:14,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 21:59:14,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 21:59:14,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 21:59:14,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 21:59:14,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 21:59:14,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 21:59:14,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 21:59:14,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 21:59:14,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 21:59:14,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 21:59:14,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 21:59:14,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 21:59:14,485 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 21:59:14,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 21:59:14,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 21:59:14,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 21:59:14,490 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 21:59:14,490 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 21:59:14,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 21:59:14,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 21:59:14,491 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 21:59:14,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 21:59:14,492 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 21:59:14,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 21:59:14,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 21:59:14,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 21:59:14,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 21:59:14,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 21:59:14,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 21:59:14,493 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 21:59:14,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 21:59:14,493 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 21:59:14,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 21:59:14,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 21:59:14,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 21:59:14,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 21:59:14,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:59:14,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 21:59:14,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 21:59:14,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 21:59:14,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 21:59:14,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 21:59:14,495 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 21:59:14,495 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 21:59:14,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 21:59:14,496 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 21:59:14,496 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 -> 5f4304a957668929d4c4ca97a168406535fe955ba86c164574a4a7768919c53b [2021-12-15 21:59:14,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 21:59:14,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 21:59:14,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 21:59:14,697 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 21:59:14,698 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 21:59:14,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c [2021-12-15 21:59:14,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782b84538/f5b74fef0da14eee92189883e2e96584/FLAGa62c91ca6 [2021-12-15 21:59:15,084 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 21:59:15,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c [2021-12-15 21:59:15,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782b84538/f5b74fef0da14eee92189883e2e96584/FLAGa62c91ca6 [2021-12-15 21:59:15,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782b84538/f5b74fef0da14eee92189883e2e96584 [2021-12-15 21:59:15,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 21:59:15,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 21:59:15,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 21:59:15,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 21:59:15,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 21:59:15,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:59:15" (1/1) ... [2021-12-15 21:59:15,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b58151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15, skipping insertion in model container [2021-12-15 21:59:15,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:59:15" (1/1) ... [2021-12-15 21:59:15,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 21:59:15,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 21:59:15,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c[42783,42796] [2021-12-15 21:59:15,718 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:59:15,724 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 21:59:15,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c[42783,42796] [2021-12-15 21:59:15,769 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:59:15,778 INFO L208 MainTranslator]: Completed translation [2021-12-15 21:59:15,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15 WrapperNode [2021-12-15 21:59:15,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 21:59:15,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 21:59:15,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 21:59:15,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 21:59:15,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15" (1/1) ... [2021-12-15 21:59:15,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15" (1/1) ... [2021-12-15 21:59:15,820 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 546 [2021-12-15 21:59:15,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 21:59:15,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 21:59:15,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 21:59:15,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 21:59:15,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15" (1/1) ... [2021-12-15 21:59:15,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15" (1/1) ... [2021-12-15 21:59:15,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15" (1/1) ... [2021-12-15 21:59:15,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15" (1/1) ... [2021-12-15 21:59:15,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15" (1/1) ... [2021-12-15 21:59:15,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15" (1/1) ... [2021-12-15 21:59:15,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15" (1/1) ... [2021-12-15 21:59:15,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 21:59:15,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 21:59:15,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 21:59:15,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 21:59:15,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15" (1/1) ... [2021-12-15 21:59:15,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:59:15,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:59:15,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 21:59:15,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 21:59:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 21:59:15,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 21:59:15,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 21:59:15,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 21:59:16,008 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 21:59:16,009 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 21:59:16,035 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-15 21:59:16,410 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-12-15 21:59:16,410 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-12-15 21:59:16,410 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 21:59:16,416 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 21:59:16,416 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 21:59:16,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:59:16 BoogieIcfgContainer [2021-12-15 21:59:16,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 21:59:16,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 21:59:16,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 21:59:16,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 21:59:16,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:59:15" (1/3) ... [2021-12-15 21:59:16,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c7cf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:59:16, skipping insertion in model container [2021-12-15 21:59:16,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:15" (2/3) ... [2021-12-15 21:59:16,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c7cf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:59:16, skipping insertion in model container [2021-12-15 21:59:16,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:59:16" (3/3) ... [2021-12-15 21:59:16,425 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2021-12-15 21:59:16,428 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 21:59:16,429 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 21:59:16,461 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 21:59:16,466 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 21:59:16,466 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 21:59:16,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-15 21:59:16,495 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:16,495 INFO L514 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] [2021-12-15 21:59:16,496 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:16,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:16,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1632006987, now seen corresponding path program 1 times [2021-12-15 21:59:16,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:16,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966564358] [2021-12-15 21:59:16,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:16,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:16,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:16,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966564358] [2021-12-15 21:59:16,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966564358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:16,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:16,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:16,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380102481] [2021-12-15 21:59:16,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:16,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:16,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:16,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:16,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:16,719 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:16,878 INFO L93 Difference]: Finished difference Result 302 states and 514 transitions. [2021-12-15 21:59:16,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:16,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-15 21:59:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:16,887 INFO L225 Difference]: With dead ends: 302 [2021-12-15 21:59:16,888 INFO L226 Difference]: Without dead ends: 149 [2021-12-15 21:59:16,890 INFO L932 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 [2021-12-15 21:59:16,893 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 31 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:16,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 366 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-15 21:59:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2021-12-15 21:59:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2021-12-15 21:59:16,945 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 44 [2021-12-15 21:59:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:16,946 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2021-12-15 21:59:16,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2021-12-15 21:59:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-15 21:59:16,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:16,953 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-15 21:59:16,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 21:59:16,954 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:16,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1827606837, now seen corresponding path program 1 times [2021-12-15 21:59:16,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:16,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507673374] [2021-12-15 21:59:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:16,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:17,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:17,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507673374] [2021-12-15 21:59:17,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507673374] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:17,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:17,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:17,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013837918] [2021-12-15 21:59:17,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:17,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:17,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:17,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:17,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:17,039 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:17,144 INFO L93 Difference]: Finished difference Result 309 states and 470 transitions. [2021-12-15 21:59:17,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:17,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-12-15 21:59:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:17,148 INFO L225 Difference]: With dead ends: 309 [2021-12-15 21:59:17,148 INFO L226 Difference]: Without dead ends: 171 [2021-12-15 21:59:17,154 INFO L932 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 [2021-12-15 21:59:17,155 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 14 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:17,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 292 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-15 21:59:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2021-12-15 21:59:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.4759036144578312) internal successors, (245), 166 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2021-12-15 21:59:17,170 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 60 [2021-12-15 21:59:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:17,171 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2021-12-15 21:59:17,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2021-12-15 21:59:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-15 21:59:17,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:17,178 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:17,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 21:59:17,179 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:17,180 INFO L85 PathProgramCache]: Analyzing trace with hash -445123559, now seen corresponding path program 1 times [2021-12-15 21:59:17,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:17,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766342997] [2021-12-15 21:59:17,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:17,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-15 21:59:17,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:17,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766342997] [2021-12-15 21:59:17,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766342997] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:17,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:17,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:17,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017093997] [2021-12-15 21:59:17,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:17,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:17,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:17,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:17,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:17,247 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:17,363 INFO L93 Difference]: Finished difference Result 372 states and 561 transitions. [2021-12-15 21:59:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:17,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-12-15 21:59:17,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:17,365 INFO L225 Difference]: With dead ends: 372 [2021-12-15 21:59:17,365 INFO L226 Difference]: Without dead ends: 213 [2021-12-15 21:59:17,366 INFO L932 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 [2021-12-15 21:59:17,372 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 15 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:17,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 289 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:17,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-15 21:59:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2021-12-15 21:59:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.4038461538461537) internal successors, (292), 208 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 292 transitions. [2021-12-15 21:59:17,392 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 292 transitions. Word has length 81 [2021-12-15 21:59:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:17,392 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 292 transitions. [2021-12-15 21:59:17,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 292 transitions. [2021-12-15 21:59:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-15 21:59:17,395 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:17,395 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:17,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 21:59:17,396 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:17,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:17,396 INFO L85 PathProgramCache]: Analyzing trace with hash -196977065, now seen corresponding path program 1 times [2021-12-15 21:59:17,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:17,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133977580] [2021-12-15 21:59:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:17,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-15 21:59:17,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:17,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133977580] [2021-12-15 21:59:17,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133977580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:17,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:17,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:17,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187650225] [2021-12-15 21:59:17,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:17,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:17,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:17,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:17,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:17,443 INFO L87 Difference]: Start difference. First operand 209 states and 292 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:17,528 INFO L93 Difference]: Finished difference Result 437 states and 619 transitions. [2021-12-15 21:59:17,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:17,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-12-15 21:59:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:17,530 INFO L225 Difference]: With dead ends: 437 [2021-12-15 21:59:17,530 INFO L226 Difference]: Without dead ends: 236 [2021-12-15 21:59:17,530 INFO L932 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 [2021-12-15 21:59:17,531 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 14 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:17,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 308 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-12-15 21:59:17,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2021-12-15 21:59:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.3852813852813852) internal successors, (320), 231 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 320 transitions. [2021-12-15 21:59:17,538 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 320 transitions. Word has length 81 [2021-12-15 21:59:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:17,538 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 320 transitions. [2021-12-15 21:59:17,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 320 transitions. [2021-12-15 21:59:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-15 21:59:17,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:17,539 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:17,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 21:59:17,540 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:17,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:17,540 INFO L85 PathProgramCache]: Analyzing trace with hash -6893799, now seen corresponding path program 1 times [2021-12-15 21:59:17,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:17,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246665675] [2021-12-15 21:59:17,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:17,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-15 21:59:17,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:17,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246665675] [2021-12-15 21:59:17,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246665675] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:17,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:17,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:17,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932456850] [2021-12-15 21:59:17,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:17,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:17,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:17,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:17,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:17,588 INFO L87 Difference]: Start difference. First operand 232 states and 320 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:17,673 INFO L93 Difference]: Finished difference Result 494 states and 695 transitions. [2021-12-15 21:59:17,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:17,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-12-15 21:59:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:17,676 INFO L225 Difference]: With dead ends: 494 [2021-12-15 21:59:17,676 INFO L226 Difference]: Without dead ends: 270 [2021-12-15 21:59:17,676 INFO L932 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 [2021-12-15 21:59:17,677 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 30 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:17,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 307 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-12-15 21:59:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2021-12-15 21:59:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.3671875) internal successors, (350), 256 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 350 transitions. [2021-12-15 21:59:17,690 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 350 transitions. Word has length 102 [2021-12-15 21:59:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:17,691 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 350 transitions. [2021-12-15 21:59:17,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 350 transitions. [2021-12-15 21:59:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-15 21:59:17,692 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:17,692 INFO L514 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] [2021-12-15 21:59:17,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 21:59:17,693 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:17,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1361423817, now seen corresponding path program 1 times [2021-12-15 21:59:17,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:17,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212816213] [2021-12-15 21:59:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:17,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-15 21:59:17,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:17,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212816213] [2021-12-15 21:59:17,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212816213] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:17,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:17,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:17,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205658624] [2021-12-15 21:59:17,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:17,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:17,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:17,743 INFO L87 Difference]: Start difference. First operand 257 states and 350 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:17,761 INFO L93 Difference]: Finished difference Result 749 states and 1020 transitions. [2021-12-15 21:59:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:17,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-12-15 21:59:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:17,763 INFO L225 Difference]: With dead ends: 749 [2021-12-15 21:59:17,763 INFO L226 Difference]: Without dead ends: 500 [2021-12-15 21:59:17,764 INFO L932 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 [2021-12-15 21:59:17,764 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 133 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:17,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 463 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-12-15 21:59:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2021-12-15 21:59:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 1.3567134268537073) internal successors, (677), 499 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 677 transitions. [2021-12-15 21:59:17,773 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 677 transitions. Word has length 121 [2021-12-15 21:59:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:17,773 INFO L470 AbstractCegarLoop]: Abstraction has 500 states and 677 transitions. [2021-12-15 21:59:17,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 677 transitions. [2021-12-15 21:59:17,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-15 21:59:17,775 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:17,775 INFO L514 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] [2021-12-15 21:59:17,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 21:59:17,775 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:17,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2036150201, now seen corresponding path program 1 times [2021-12-15 21:59:17,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:17,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872706015] [2021-12-15 21:59:17,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:17,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-15 21:59:17,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:17,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872706015] [2021-12-15 21:59:17,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872706015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:17,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:17,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:17,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174031055] [2021-12-15 21:59:17,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:17,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:17,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:17,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:17,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:17,814 INFO L87 Difference]: Start difference. First operand 500 states and 677 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:17,834 INFO L93 Difference]: Finished difference Result 1237 states and 1677 transitions. [2021-12-15 21:59:17,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:17,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-12-15 21:59:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:17,837 INFO L225 Difference]: With dead ends: 1237 [2021-12-15 21:59:17,837 INFO L226 Difference]: Without dead ends: 745 [2021-12-15 21:59:17,838 INFO L932 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 [2021-12-15 21:59:17,838 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 135 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:17,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 497 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2021-12-15 21:59:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2021-12-15 21:59:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 744 states have (on average 1.353494623655914) internal successors, (1007), 744 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1007 transitions. [2021-12-15 21:59:17,849 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1007 transitions. Word has length 121 [2021-12-15 21:59:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:17,850 INFO L470 AbstractCegarLoop]: Abstraction has 745 states and 1007 transitions. [2021-12-15 21:59:17,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1007 transitions. [2021-12-15 21:59:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-15 21:59:17,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:17,851 INFO L514 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] [2021-12-15 21:59:17,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 21:59:17,852 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:17,852 INFO L85 PathProgramCache]: Analyzing trace with hash 157019255, now seen corresponding path program 1 times [2021-12-15 21:59:17,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:17,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834305037] [2021-12-15 21:59:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:17,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-15 21:59:17,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:17,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834305037] [2021-12-15 21:59:17,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834305037] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:17,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:17,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:17,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951562232] [2021-12-15 21:59:17,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:17,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:17,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:17,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:17,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:17,876 INFO L87 Difference]: Start difference. First operand 745 states and 1007 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:17,910 INFO L93 Difference]: Finished difference Result 1506 states and 2032 transitions. [2021-12-15 21:59:17,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:17,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-12-15 21:59:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:17,912 INFO L225 Difference]: With dead ends: 1506 [2021-12-15 21:59:17,912 INFO L226 Difference]: Without dead ends: 769 [2021-12-15 21:59:17,913 INFO L932 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 [2021-12-15 21:59:17,914 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 10 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:17,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 390 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2021-12-15 21:59:17,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2021-12-15 21:59:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 768 states have (on average 1.3489583333333333) internal successors, (1036), 768 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1036 transitions. [2021-12-15 21:59:17,924 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1036 transitions. Word has length 121 [2021-12-15 21:59:17,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:17,925 INFO L470 AbstractCegarLoop]: Abstraction has 769 states and 1036 transitions. [2021-12-15 21:59:17,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1036 transitions. [2021-12-15 21:59:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-15 21:59:17,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:17,926 INFO L514 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] [2021-12-15 21:59:17,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 21:59:17,927 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:17,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1876374791, now seen corresponding path program 1 times [2021-12-15 21:59:17,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:17,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825307984] [2021-12-15 21:59:17,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:17,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-15 21:59:17,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:17,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825307984] [2021-12-15 21:59:17,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825307984] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:17,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:17,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:17,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114015069] [2021-12-15 21:59:17,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:17,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:17,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:17,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:17,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:17,952 INFO L87 Difference]: Start difference. First operand 769 states and 1036 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:17,967 INFO L93 Difference]: Finished difference Result 1543 states and 2074 transitions. [2021-12-15 21:59:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:17,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-12-15 21:59:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:17,969 INFO L225 Difference]: With dead ends: 1543 [2021-12-15 21:59:17,969 INFO L226 Difference]: Without dead ends: 782 [2021-12-15 21:59:17,970 INFO L932 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 [2021-12-15 21:59:17,971 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 6 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:17,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 370 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:17,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2021-12-15 21:59:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2021-12-15 21:59:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.3431498079385404) internal successors, (1049), 781 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1049 transitions. [2021-12-15 21:59:17,982 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1049 transitions. Word has length 121 [2021-12-15 21:59:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:17,982 INFO L470 AbstractCegarLoop]: Abstraction has 782 states and 1049 transitions. [2021-12-15 21:59:17,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1049 transitions. [2021-12-15 21:59:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-15 21:59:17,984 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:17,984 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:17,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 21:59:17,985 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:17,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1115911210, now seen corresponding path program 1 times [2021-12-15 21:59:17,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:17,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871492506] [2021-12-15 21:59:17,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:17,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-15 21:59:18,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:18,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871492506] [2021-12-15 21:59:18,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871492506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:18,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:18,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:18,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102174163] [2021-12-15 21:59:18,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:18,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:18,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:18,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:18,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:18,017 INFO L87 Difference]: Start difference. First operand 782 states and 1049 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:18,119 INFO L93 Difference]: Finished difference Result 1659 states and 2274 transitions. [2021-12-15 21:59:18,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:18,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-12-15 21:59:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:18,122 INFO L225 Difference]: With dead ends: 1659 [2021-12-15 21:59:18,122 INFO L226 Difference]: Without dead ends: 898 [2021-12-15 21:59:18,123 INFO L932 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 [2021-12-15 21:59:18,123 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 35 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:18,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 292 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-12-15 21:59:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 864. [2021-12-15 21:59:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 863 states have (on average 1.3290845886442642) internal successors, (1147), 863 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1147 transitions. [2021-12-15 21:59:18,136 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1147 transitions. Word has length 159 [2021-12-15 21:59:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:18,136 INFO L470 AbstractCegarLoop]: Abstraction has 864 states and 1147 transitions. [2021-12-15 21:59:18,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1147 transitions. [2021-12-15 21:59:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-12-15 21:59:18,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:18,138 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:18,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 21:59:18,138 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:18,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:18,139 INFO L85 PathProgramCache]: Analyzing trace with hash 479789562, now seen corresponding path program 1 times [2021-12-15 21:59:18,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:18,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022536059] [2021-12-15 21:59:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:18,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-15 21:59:18,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:18,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022536059] [2021-12-15 21:59:18,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022536059] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:18,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:18,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:18,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867133442] [2021-12-15 21:59:18,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:18,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:18,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:18,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:18,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:18,182 INFO L87 Difference]: Start difference. First operand 864 states and 1147 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:18,292 INFO L93 Difference]: Finished difference Result 1877 states and 2562 transitions. [2021-12-15 21:59:18,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:18,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2021-12-15 21:59:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:18,296 INFO L225 Difference]: With dead ends: 1877 [2021-12-15 21:59:18,296 INFO L226 Difference]: Without dead ends: 1031 [2021-12-15 21:59:18,297 INFO L932 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 [2021-12-15 21:59:18,297 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 160 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:18,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 156 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2021-12-15 21:59:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1017. [2021-12-15 21:59:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1016 states have (on average 1.3799212598425197) internal successors, (1402), 1016 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1402 transitions. [2021-12-15 21:59:18,313 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1402 transitions. Word has length 172 [2021-12-15 21:59:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:18,314 INFO L470 AbstractCegarLoop]: Abstraction has 1017 states and 1402 transitions. [2021-12-15 21:59:18,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1402 transitions. [2021-12-15 21:59:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-15 21:59:18,316 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:18,316 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:18,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 21:59:18,317 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:18,317 INFO L85 PathProgramCache]: Analyzing trace with hash 595549721, now seen corresponding path program 1 times [2021-12-15 21:59:18,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:18,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971611211] [2021-12-15 21:59:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:18,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-12-15 21:59:18,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:18,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971611211] [2021-12-15 21:59:18,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971611211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:18,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:18,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:18,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072435843] [2021-12-15 21:59:18,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:18,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:18,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:18,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:18,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:18,353 INFO L87 Difference]: Start difference. First operand 1017 states and 1402 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:18,378 INFO L93 Difference]: Finished difference Result 2890 states and 4017 transitions. [2021-12-15 21:59:18,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:18,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2021-12-15 21:59:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:18,383 INFO L225 Difference]: With dead ends: 2890 [2021-12-15 21:59:18,383 INFO L226 Difference]: Without dead ends: 1894 [2021-12-15 21:59:18,384 INFO L932 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 [2021-12-15 21:59:18,385 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 132 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:18,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 524 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2021-12-15 21:59:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1892. [2021-12-15 21:59:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1891 states have (on average 1.3913273400317292) internal successors, (2631), 1891 states have internal predecessors, (2631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2631 transitions. [2021-12-15 21:59:18,413 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2631 transitions. Word has length 201 [2021-12-15 21:59:18,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:18,413 INFO L470 AbstractCegarLoop]: Abstraction has 1892 states and 2631 transitions. [2021-12-15 21:59:18,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2631 transitions. [2021-12-15 21:59:18,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-15 21:59:18,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:18,416 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:18,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 21:59:18,417 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:18,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:18,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1738052187, now seen corresponding path program 1 times [2021-12-15 21:59:18,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:18,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099866535] [2021-12-15 21:59:18,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:18,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-15 21:59:18,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:18,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099866535] [2021-12-15 21:59:18,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099866535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:18,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:18,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:18,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224180129] [2021-12-15 21:59:18,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:18,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:18,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:18,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:18,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:18,449 INFO L87 Difference]: Start difference. First operand 1892 states and 2631 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:18,581 INFO L93 Difference]: Finished difference Result 3949 states and 5567 transitions. [2021-12-15 21:59:18,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:18,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2021-12-15 21:59:18,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:18,601 INFO L225 Difference]: With dead ends: 3949 [2021-12-15 21:59:18,601 INFO L226 Difference]: Without dead ends: 2078 [2021-12-15 21:59:18,619 INFO L932 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 [2021-12-15 21:59:18,620 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 13 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:18,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 302 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2021-12-15 21:59:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2078. [2021-12-15 21:59:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 2077 states have (on average 1.3707270101107367) internal successors, (2847), 2077 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2847 transitions. [2021-12-15 21:59:18,688 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2847 transitions. Word has length 201 [2021-12-15 21:59:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:18,689 INFO L470 AbstractCegarLoop]: Abstraction has 2078 states and 2847 transitions. [2021-12-15 21:59:18,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2847 transitions. [2021-12-15 21:59:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-12-15 21:59:18,692 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:18,692 INFO L514 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:18,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 21:59:18,693 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:18,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1107406070, now seen corresponding path program 1 times [2021-12-15 21:59:18,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:18,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863681711] [2021-12-15 21:59:18,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:18,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2021-12-15 21:59:18,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:18,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863681711] [2021-12-15 21:59:18,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863681711] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:18,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:18,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:18,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499211567] [2021-12-15 21:59:18,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:18,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:18,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:18,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:18,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:18,784 INFO L87 Difference]: Start difference. First operand 2078 states and 2847 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:18,894 INFO L93 Difference]: Finished difference Result 4387 states and 6125 transitions. [2021-12-15 21:59:18,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:18,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2021-12-15 21:59:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:18,898 INFO L225 Difference]: With dead ends: 4387 [2021-12-15 21:59:18,898 INFO L226 Difference]: Without dead ends: 1401 [2021-12-15 21:59:18,901 INFO L932 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 [2021-12-15 21:59:18,901 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 9 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:18,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 308 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2021-12-15 21:59:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1401. [2021-12-15 21:59:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 1.3585714285714285) internal successors, (1902), 1400 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1902 transitions. [2021-12-15 21:59:18,922 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1902 transitions. Word has length 229 [2021-12-15 21:59:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:18,922 INFO L470 AbstractCegarLoop]: Abstraction has 1401 states and 1902 transitions. [2021-12-15 21:59:18,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1902 transitions. [2021-12-15 21:59:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2021-12-15 21:59:18,925 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:18,925 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:18,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 21:59:18,926 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:18,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash -604667897, now seen corresponding path program 1 times [2021-12-15 21:59:18,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:18,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530889356] [2021-12-15 21:59:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:18,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2021-12-15 21:59:18,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:18,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530889356] [2021-12-15 21:59:18,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530889356] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:18,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:18,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:18,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459731982] [2021-12-15 21:59:18,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:18,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:18,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:18,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:18,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:18,962 INFO L87 Difference]: Start difference. First operand 1401 states and 1902 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,060 INFO L93 Difference]: Finished difference Result 2921 states and 4015 transitions. [2021-12-15 21:59:19,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2021-12-15 21:59:19,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,064 INFO L225 Difference]: With dead ends: 2921 [2021-12-15 21:59:19,064 INFO L226 Difference]: Without dead ends: 1541 [2021-12-15 21:59:19,065 INFO L932 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 [2021-12-15 21:59:19,066 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 19 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:19,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 302 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2021-12-15 21:59:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1509. [2021-12-15 21:59:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.3461538461538463) internal successors, (2030), 1508 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2030 transitions. [2021-12-15 21:59:19,087 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2030 transitions. Word has length 316 [2021-12-15 21:59:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,087 INFO L470 AbstractCegarLoop]: Abstraction has 1509 states and 2030 transitions. [2021-12-15 21:59:19,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2030 transitions. [2021-12-15 21:59:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2021-12-15 21:59:19,090 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,090 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:19,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 21:59:19,091 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1654792079, now seen corresponding path program 1 times [2021-12-15 21:59:19,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020957916] [2021-12-15 21:59:19,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2021-12-15 21:59:19,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020957916] [2021-12-15 21:59:19,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020957916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696881311] [2021-12-15 21:59:19,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,130 INFO L87 Difference]: Start difference. First operand 1509 states and 2030 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,241 INFO L93 Difference]: Finished difference Result 3121 states and 4243 transitions. [2021-12-15 21:59:19,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 339 [2021-12-15 21:59:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,245 INFO L225 Difference]: With dead ends: 3121 [2021-12-15 21:59:19,245 INFO L226 Difference]: Without dead ends: 1633 [2021-12-15 21:59:19,247 INFO L932 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 [2021-12-15 21:59:19,248 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:19,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 302 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2021-12-15 21:59:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1625. [2021-12-15 21:59:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1624 states have (on average 1.333743842364532) internal successors, (2166), 1624 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2166 transitions. [2021-12-15 21:59:19,315 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2166 transitions. Word has length 339 [2021-12-15 21:59:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,315 INFO L470 AbstractCegarLoop]: Abstraction has 1625 states and 2166 transitions. [2021-12-15 21:59:19,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2166 transitions. [2021-12-15 21:59:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-12-15 21:59:19,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,320 INFO L514 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, 1, 1] [2021-12-15 21:59:19,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 21:59:19,320 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash -240397493, now seen corresponding path program 1 times [2021-12-15 21:59:19,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836729797] [2021-12-15 21:59:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-12-15 21:59:19,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836729797] [2021-12-15 21:59:19,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836729797] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:59:19,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792036025] [2021-12-15 21:59:19,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:59:19,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:59:19,420 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:59:19,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 21:59:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 21:59:19,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:59:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-12-15 21:59:20,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:59:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-12-15 21:59:20,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792036025] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:59:20,439 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:59:20,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-15 21:59:20,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905106966] [2021-12-15 21:59:20,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:59:20,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 21:59:20,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 21:59:20,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 21:59:20,441 INFO L87 Difference]: Start difference. First operand 1625 states and 2166 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:20,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:20,724 INFO L93 Difference]: Finished difference Result 3959 states and 5354 transitions. [2021-12-15 21:59:20,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 21:59:20,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 372 [2021-12-15 21:59:20,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:20,730 INFO L225 Difference]: With dead ends: 3959 [2021-12-15 21:59:20,731 INFO L226 Difference]: Without dead ends: 2236 [2021-12-15 21:59:20,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-15 21:59:20,748 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 916 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:20,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [916 Valid, 389 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 21:59:20,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2021-12-15 21:59:20,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 1633. [2021-12-15 21:59:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1632 states have (on average 1.3198529411764706) internal successors, (2154), 1632 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2154 transitions. [2021-12-15 21:59:20,780 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2154 transitions. Word has length 372 [2021-12-15 21:59:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:20,781 INFO L470 AbstractCegarLoop]: Abstraction has 1633 states and 2154 transitions. [2021-12-15 21:59:20,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2154 transitions. [2021-12-15 21:59:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2021-12-15 21:59:20,786 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:20,786 INFO L514 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, 1, 1] [2021-12-15 21:59:20,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-15 21:59:21,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-15 21:59:21,004 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash -118519316, now seen corresponding path program 1 times [2021-12-15 21:59:21,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:21,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154236260] [2021-12-15 21:59:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:21,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2021-12-15 21:59:21,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:21,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154236260] [2021-12-15 21:59:21,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154236260] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:21,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:21,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:21,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872777085] [2021-12-15 21:59:21,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:21,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:21,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:21,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:21,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:21,071 INFO L87 Difference]: Start difference. First operand 1633 states and 2154 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:21,174 INFO L93 Difference]: Finished difference Result 3425 states and 4593 transitions. [2021-12-15 21:59:21,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:21,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 472 [2021-12-15 21:59:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:21,179 INFO L225 Difference]: With dead ends: 3425 [2021-12-15 21:59:21,179 INFO L226 Difference]: Without dead ends: 1813 [2021-12-15 21:59:21,181 INFO L932 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 [2021-12-15 21:59:21,181 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:21,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2021-12-15 21:59:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1803. [2021-12-15 21:59:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1802 states have (on average 1.3035516093229744) internal successors, (2349), 1802 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2349 transitions. [2021-12-15 21:59:21,214 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2349 transitions. Word has length 472 [2021-12-15 21:59:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:21,214 INFO L470 AbstractCegarLoop]: Abstraction has 1803 states and 2349 transitions. [2021-12-15 21:59:21,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2349 transitions. [2021-12-15 21:59:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2021-12-15 21:59:21,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:21,220 INFO L514 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, 1, 1] [2021-12-15 21:59:21,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 21:59:21,221 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:21,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:21,221 INFO L85 PathProgramCache]: Analyzing trace with hash 996725818, now seen corresponding path program 1 times [2021-12-15 21:59:21,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:21,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247462176] [2021-12-15 21:59:21,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:21,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2021-12-15 21:59:21,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:21,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247462176] [2021-12-15 21:59:21,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247462176] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:21,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:21,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:21,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321712852] [2021-12-15 21:59:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:21,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:21,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:21,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:21,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:21,284 INFO L87 Difference]: Start difference. First operand 1803 states and 2349 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:21,393 INFO L93 Difference]: Finished difference Result 3775 states and 5003 transitions. [2021-12-15 21:59:21,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:21,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 534 [2021-12-15 21:59:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:21,399 INFO L225 Difference]: With dead ends: 3775 [2021-12-15 21:59:21,399 INFO L226 Difference]: Without dead ends: 1993 [2021-12-15 21:59:21,401 INFO L932 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 [2021-12-15 21:59:21,402 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:21,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:59:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2021-12-15 21:59:21,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1983. [2021-12-15 21:59:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1983 states, 1982 states have (on average 1.2885973763874874) internal successors, (2554), 1982 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:21,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2554 transitions. [2021-12-15 21:59:21,452 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2554 transitions. Word has length 534 [2021-12-15 21:59:21,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:21,453 INFO L470 AbstractCegarLoop]: Abstraction has 1983 states and 2554 transitions. [2021-12-15 21:59:21,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2554 transitions. [2021-12-15 21:59:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2021-12-15 21:59:21,460 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:21,460 INFO L514 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, 1, 1] [2021-12-15 21:59:21,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-15 21:59:21,461 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:21,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 712864204, now seen corresponding path program 1 times [2021-12-15 21:59:21,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:21,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457447165] [2021-12-15 21:59:21,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:21,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-12-15 21:59:21,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:21,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457447165] [2021-12-15 21:59:21,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457447165] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:59:21,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302097527] [2021-12-15 21:59:21,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:21,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:59:21,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:59:21,545 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:59:21,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 21:59:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:21,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 21:59:21,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:59:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-12-15 21:59:22,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:59:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-12-15 21:59:22,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302097527] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:59:22,980 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:59:22,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-12-15 21:59:22,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059290437] [2021-12-15 21:59:22,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:59:22,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 21:59:22,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:22,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 21:59:22,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-15 21:59:22,982 INFO L87 Difference]: Start difference. First operand 1983 states and 2554 transitions. Second operand has 8 states, 8 states have (on average 41.625) internal successors, (333), 8 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:23,305 INFO L93 Difference]: Finished difference Result 2831 states and 3660 transitions. [2021-12-15 21:59:23,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 21:59:23,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.625) internal successors, (333), 8 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 600 [2021-12-15 21:59:23,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:23,306 INFO L225 Difference]: With dead ends: 2831 [2021-12-15 21:59:23,307 INFO L226 Difference]: Without dead ends: 0 [2021-12-15 21:59:23,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 1199 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-15 21:59:23,309 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 195 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 21:59:23,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 1033 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 21:59:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-15 21:59:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-15 21:59:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-15 21:59:23,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 600 [2021-12-15 21:59:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:23,310 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 21:59:23,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.625) internal successors, (333), 8 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:59:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-15 21:59:23,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-15 21:59:23,312 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 21:59:23,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 21:59:23,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-12-15 21:59:23,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-15 21:59:24,620 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2021-12-15 21:59:24,620 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 561) the Hoare annotation is: (or (and (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672) (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (and (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2))) [2021-12-15 21:59:24,620 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 572) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,621 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 582) the Hoare annotation is: (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672) [2021-12-15 21:59:24,621 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2021-12-15 21:59:24,621 INFO L861 garLoopResultBuilder]: At program point L631(lines 622 633) the Hoare annotation is: true [2021-12-15 21:59:24,621 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2021-12-15 21:59:24,621 INFO L858 garLoopResultBuilder]: For program point L599(lines 599 603) no Hoare annotation was computed. [2021-12-15 21:59:24,621 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 559) no Hoare annotation was computed. [2021-12-15 21:59:24,622 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 570) no Hoare annotation was computed. [2021-12-15 21:59:24,622 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 581) no Hoare annotation was computed. [2021-12-15 21:59:24,622 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2021-12-15 21:59:24,622 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2021-12-15 21:59:24,622 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2021-12-15 21:59:24,622 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 219 552) no Hoare annotation was computed. [2021-12-15 21:59:24,622 INFO L858 garLoopResultBuilder]: For program point L502(lines 502 505) no Hoare annotation was computed. [2021-12-15 21:59:24,622 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-12-15 21:59:24,622 INFO L858 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2021-12-15 21:59:24,623 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2021-12-15 21:59:24,623 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2021-12-15 21:59:24,623 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 558) no Hoare annotation was computed. [2021-12-15 21:59:24,623 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 569) no Hoare annotation was computed. [2021-12-15 21:59:24,623 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 580) no Hoare annotation was computed. [2021-12-15 21:59:24,623 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 559) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1) (and .cse0 .cse2 .cse1) (and .cse0 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,623 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 570) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,624 INFO L858 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2021-12-15 21:59:24,624 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2021-12-15 21:59:24,624 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 557) no Hoare annotation was computed. [2021-12-15 21:59:24,624 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 568) no Hoare annotation was computed. [2021-12-15 21:59:24,624 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 579) no Hoare annotation was computed. [2021-12-15 21:59:24,625 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 608) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2))) (or (and .cse0 .cse1) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8560) .cse1) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse2 .cse1) (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse0 .cse3) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544) .cse1) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse3) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8464)) (and (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse2 .cse1) (and (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672) (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2 .cse3) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)))) [2021-12-15 21:59:24,625 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 546) no Hoare annotation was computed. [2021-12-15 21:59:24,625 INFO L858 garLoopResultBuilder]: For program point L507(lines 507 509) no Hoare annotation was computed. [2021-12-15 21:59:24,626 INFO L858 garLoopResultBuilder]: For program point L540-1(lines 540 546) no Hoare annotation was computed. [2021-12-15 21:59:24,626 INFO L858 garLoopResultBuilder]: For program point L507-2(lines 219 552) no Hoare annotation was computed. [2021-12-15 21:59:24,626 INFO L854 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,626 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2021-12-15 21:59:24,626 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 568) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3))) (or (and .cse0 .cse1 .cse2) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse3) (and .cse0 .cse1 .cse3))) [2021-12-15 21:59:24,626 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 581) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse0) (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1 .cse0) (and .cse2 .cse3 .cse1) (and .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,626 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2021-12-15 21:59:24,626 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2021-12-15 21:59:24,627 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2021-12-15 21:59:24,627 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 556) no Hoare annotation was computed. [2021-12-15 21:59:24,627 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 567) no Hoare annotation was computed. [2021-12-15 21:59:24,627 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 578) no Hoare annotation was computed. [2021-12-15 21:59:24,627 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 589) no Hoare annotation was computed. [2021-12-15 21:59:24,627 INFO L861 garLoopResultBuilder]: At program point L609(lines 109 610) the Hoare annotation is: true [2021-12-15 21:59:24,627 INFO L858 garLoopResultBuilder]: For program point L543(lines 543 545) no Hoare annotation was computed. [2021-12-15 21:59:24,627 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2021-12-15 21:59:24,627 INFO L858 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2021-12-15 21:59:24,628 INFO L858 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2021-12-15 21:59:24,628 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 557) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse1) (and .cse0 .cse2 .cse1) (and .cse2 .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)))) [2021-12-15 21:59:24,628 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 589) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,628 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 555) no Hoare annotation was computed. [2021-12-15 21:59:24,629 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 566) no Hoare annotation was computed. [2021-12-15 21:59:24,629 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 577) no Hoare annotation was computed. [2021-12-15 21:59:24,629 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 588) no Hoare annotation was computed. [2021-12-15 21:59:24,629 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2021-12-15 21:59:24,629 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2021-12-15 21:59:24,629 INFO L861 garLoopResultBuilder]: At program point L216(lines 215 555) the Hoare annotation is: true [2021-12-15 21:59:24,629 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 567) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse0) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,630 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 578) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse1 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse0 .cse1) (and .cse2 .cse3 .cse0) (and .cse4 .cse1) (and .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse2 .cse4 .cse3))) [2021-12-15 21:59:24,630 INFO L858 garLoopResultBuilder]: For program point L614(lines 614 616) no Hoare annotation was computed. [2021-12-15 21:59:24,630 INFO L858 garLoopResultBuilder]: For program point L614-2(lines 614 616) no Hoare annotation was computed. [2021-12-15 21:59:24,631 INFO L858 garLoopResultBuilder]: For program point L515(lines 515 518) no Hoare annotation was computed. [2021-12-15 21:59:24,631 INFO L858 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2021-12-15 21:59:24,631 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-15 21:59:24,631 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 555) the Hoare annotation is: true [2021-12-15 21:59:24,631 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 565) no Hoare annotation was computed. [2021-12-15 21:59:24,631 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 576) no Hoare annotation was computed. [2021-12-15 21:59:24,631 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 587) no Hoare annotation was computed. [2021-12-15 21:59:24,632 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2021-12-15 21:59:24,632 INFO L858 garLoopResultBuilder]: For program point L285-2(lines 219 552) no Hoare annotation was computed. [2021-12-15 21:59:24,632 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2021-12-15 21:59:24,632 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2021-12-15 21:59:24,632 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2021-12-15 21:59:24,632 INFO L858 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2021-12-15 21:59:24,632 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2021-12-15 21:59:24,632 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 564) no Hoare annotation was computed. [2021-12-15 21:59:24,633 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 575) no Hoare annotation was computed. [2021-12-15 21:59:24,633 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 586) no Hoare annotation was computed. [2021-12-15 21:59:24,633 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2021-12-15 21:59:24,633 INFO L858 garLoopResultBuilder]: For program point L486-2(lines 219 552) no Hoare annotation was computed. [2021-12-15 21:59:24,633 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2021-12-15 21:59:24,633 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2021-12-15 21:59:24,633 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 588) the Hoare annotation is: (let ((.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse0 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (and .cse1 .cse0))) [2021-12-15 21:59:24,633 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 565) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse0) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,633 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 576) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,634 INFO L861 garLoopResultBuilder]: At program point L619(lines 22 621) the Hoare annotation is: true [2021-12-15 21:59:24,634 INFO L854 garLoopResultBuilder]: At program point L553(lines 110 608) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2))) (or (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse0 .cse1) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544) .cse2) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3) .cse1) (and .cse0 .cse2) (and .cse2 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (and (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse3 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8560) .cse2) (and (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672) (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse3 .cse1) (and .cse2 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse3 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)))) [2021-12-15 21:59:24,634 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2021-12-15 21:59:24,634 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2021-12-15 21:59:24,634 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-15 21:59:24,634 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 563) no Hoare annotation was computed. [2021-12-15 21:59:24,634 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 574) no Hoare annotation was computed. [2021-12-15 21:59:24,634 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 585) no Hoare annotation was computed. [2021-12-15 21:59:24,635 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2021-12-15 21:59:24,635 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 525) no Hoare annotation was computed. [2021-12-15 21:59:24,635 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-15 21:59:24,635 INFO L858 garLoopResultBuilder]: For program point L590(lines 590 606) no Hoare annotation was computed. [2021-12-15 21:59:24,635 INFO L854 garLoopResultBuilder]: At program point L524(lines 83 620) the Hoare annotation is: false [2021-12-15 21:59:24,635 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2021-12-15 21:59:24,635 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2021-12-15 21:59:24,635 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 562) no Hoare annotation was computed. [2021-12-15 21:59:24,635 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 573) no Hoare annotation was computed. [2021-12-15 21:59:24,635 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2021-12-15 21:59:24,636 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 584) no Hoare annotation was computed. [2021-12-15 21:59:24,636 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 605) no Hoare annotation was computed. [2021-12-15 21:59:24,636 INFO L858 garLoopResultBuilder]: For program point L492(lines 492 496) no Hoare annotation was computed. [2021-12-15 21:59:24,636 INFO L858 garLoopResultBuilder]: For program point L492-2(lines 492 496) no Hoare annotation was computed. [2021-12-15 21:59:24,636 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 563) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse0) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,636 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 574) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,636 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2021-12-15 21:59:24,636 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2021-12-15 21:59:24,636 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 597) no Hoare annotation was computed. [2021-12-15 21:59:24,637 INFO L858 garLoopResultBuilder]: For program point L526(lines 526 528) no Hoare annotation was computed. [2021-12-15 21:59:24,637 INFO L858 garLoopResultBuilder]: For program point L592-2(lines 591 605) no Hoare annotation was computed. [2021-12-15 21:59:24,637 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2021-12-15 21:59:24,637 INFO L854 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,637 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 561) no Hoare annotation was computed. [2021-12-15 21:59:24,637 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 572) no Hoare annotation was computed. [2021-12-15 21:59:24,637 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 583) no Hoare annotation was computed. [2021-12-15 21:59:24,637 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-15 21:59:24,637 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) no Hoare annotation was computed. [2021-12-15 21:59:24,638 INFO L858 garLoopResultBuilder]: For program point L594(lines 594 596) no Hoare annotation was computed. [2021-12-15 21:59:24,638 INFO L858 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2021-12-15 21:59:24,638 INFO L854 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,638 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 584) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0)))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse0 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)))) [2021-12-15 21:59:24,638 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2021-12-15 21:59:24,638 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2021-12-15 21:59:24,638 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2021-12-15 21:59:24,639 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 219 552) no Hoare annotation was computed. [2021-12-15 21:59:24,639 INFO L858 garLoopResultBuilder]: For program point L530(lines 530 534) no Hoare annotation was computed. [2021-12-15 21:59:24,639 INFO L858 garLoopResultBuilder]: For program point L530-2(lines 530 534) no Hoare annotation was computed. [2021-12-15 21:59:24,639 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2021-12-15 21:59:24,639 INFO L858 garLoopResultBuilder]: For program point L332-2(lines 219 552) no Hoare annotation was computed. [2021-12-15 21:59:24,639 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 560) no Hoare annotation was computed. [2021-12-15 21:59:24,639 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 571) no Hoare annotation was computed. [2021-12-15 21:59:24,639 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 582) no Hoare annotation was computed. [2021-12-15 21:59:24,639 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2021-12-15 21:59:24,639 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 83 620) no Hoare annotation was computed. [2021-12-15 21:59:24,643 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:24,644 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 21:59:24,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:59:24 BoogieIcfgContainer [2021-12-15 21:59:24,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 21:59:24,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 21:59:24,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 21:59:24,675 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 21:59:24,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:59:16" (3/4) ... [2021-12-15 21:59:24,678 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-15 21:59:24,700 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-12-15 21:59:24,701 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-15 21:59:24,701 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-15 21:59:24,702 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-15 21:59:24,771 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 21:59:24,771 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 21:59:24,771 INFO L158 Benchmark]: Toolchain (without parser) took 9276.98ms. Allocated memory was 96.5MB in the beginning and 257.9MB in the end (delta: 161.5MB). Free memory was 68.7MB in the beginning and 222.0MB in the end (delta: -153.3MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. [2021-12-15 21:59:24,772 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 21:59:24,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.84ms. Allocated memory was 96.5MB in the beginning and 153.1MB in the end (delta: 56.6MB). Free memory was 68.7MB in the beginning and 124.1MB in the end (delta: -55.4MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2021-12-15 21:59:24,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.05ms. Allocated memory is still 153.1MB. Free memory was 124.1MB in the beginning and 121.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-15 21:59:24,775 INFO L158 Benchmark]: Boogie Preprocessor took 41.93ms. Allocated memory is still 153.1MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 21:59:24,775 INFO L158 Benchmark]: RCFGBuilder took 554.26ms. Allocated memory is still 153.1MB. Free memory was 119.0MB in the beginning and 90.5MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-15 21:59:24,775 INFO L158 Benchmark]: TraceAbstraction took 8254.77ms. Allocated memory was 153.1MB in the beginning and 257.9MB in the end (delta: 104.9MB). Free memory was 90.2MB in the beginning and 81.0MB in the end (delta: 9.3MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2021-12-15 21:59:24,775 INFO L158 Benchmark]: Witness Printer took 96.51ms. Allocated memory is still 257.9MB. Free memory was 81.0MB in the beginning and 222.0MB in the end (delta: -141.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 21:59:24,778 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.15ms. Allocated memory is still 96.5MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.84ms. Allocated memory was 96.5MB in the beginning and 153.1MB in the end (delta: 56.6MB). Free memory was 68.7MB in the beginning and 124.1MB in the end (delta: -55.4MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.05ms. Allocated memory is still 153.1MB. Free memory was 124.1MB in the beginning and 121.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.93ms. Allocated memory is still 153.1MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 554.26ms. Allocated memory is still 153.1MB. Free memory was 119.0MB in the beginning and 90.5MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8254.77ms. Allocated memory was 153.1MB in the beginning and 257.9MB in the end (delta: 104.9MB). Free memory was 90.2MB in the beginning and 81.0MB in the end (delta: 9.3MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. * Witness Printer took 96.51ms. Allocated memory is still 257.9MB. Free memory was 81.0MB in the beginning and 222.0MB in the end (delta: -141.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 618]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 20, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1900 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1900 mSDsluCounter, 7476 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3163 mSDsCounter, 520 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2564 IncrementalHoareTripleChecker+Invalid, 3084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 520 mSolverCounterUnsat, 4313 mSDtfsCounter, 2564 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2016 GetRequests, 1981 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2078occurred in iteration=13, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 741 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 212 NumberOfFragments, 823 HoareAnnotationTreeSize, 28 FomulaSimplifications, 1084 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 1531 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 5419 NumberOfCodeBlocks, 5419 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6367 ConstructedInterpolants, 0 QuantifiedInterpolants, 8199 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1536 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 25699/25855 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((blastFlag == 2 && s__state < 8576) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: s__state <= 8672 - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((blastFlag == 2 && s__state < 8576) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((s__state < 8656 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((blastFlag == 0 && s__state < 8576) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 2) && s__state < 8576)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((!(s__hit == 0) && blastFlag == 2) || (s__state == 8560 && blastFlag == 2)) || ((s__state == 8656 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2)) || s__state == 3) || (!(s__hit == 0) && blastFlag == 3)) || (s__state == 8544 && blastFlag == 2)) || ((s__state == 8448 && s__s3__tmp__next_state___0 == 3) && blastFlag == 3)) || (blastFlag == 2 && s__state == 8512)) || (blastFlag == 0 && s__state == 8464)) || ((s__state < 8656 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2)) || (((s__state <= 8672 && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 3)) || (blastFlag == 2 && s__state == 8528)) || (s__state == 8496 && blastFlag == 1) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((s__state == 3 || (!(s__hit == 0) && blastFlag == 3)) || (s__state == 8544 && blastFlag == 2)) || ((s__state == 8448 && s__s3__tmp__next_state___0 == 3) && blastFlag == 3)) || (!(s__hit == 0) && blastFlag == 2)) || (blastFlag == 2 && s__state == 8512)) || ((s__state < 8656 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2)) || (s__state == 8560 && blastFlag == 2)) || (((s__state <= 8672 && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 3)) || (blastFlag == 2 && s__state == 8528)) || ((s__state == 8656 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2)) || (s__state == 8496 && blastFlag == 1) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 2) && s__state < 8576) || (!(s__hit == 0) && blastFlag == 3)) || (!(s__hit == 0) && blastFlag == 2) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((8672 <= s__state && !(s__hit == 0)) && blastFlag == 2) || ((8672 <= s__state && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((!(s__hit == 0) && s__state == 8448) && blastFlag == 2) || ((s__state == 8448 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2)) || ((s__state == 8448 && s__s3__tmp__next_state___0 == 3) && blastFlag == 3)) || ((!(s__hit == 0) && s__state == 8448) && blastFlag == 3) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((s__state < 8656 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((blastFlag == 2 && s__state < 8576) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((8672 <= s__state && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 3) || ((8672 <= s__state && !(s__hit == 0)) && blastFlag == 3)) || ((!(s__hit == 0) && 8672 <= s__state) && blastFlag == 2) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 2) && s__state < 8576) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((blastFlag == 2 && s__state < 8576) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((blastFlag == 2 && s__state < 8576) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((blastFlag == 2 && s__state < 8576) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((s__state < 8656 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 2) && s__state < 8576) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || (blastFlag == 1 && s__state < 8576)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3)) || ((s__state <= 8672 && blastFlag == 1) && !(s__hit == 0)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (s__state <= 8672 && !(s__hit == 0)) || ((s__state < 8656 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((blastFlag == 2 && s__state < 8576) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 2)) || ((s__state <= 8672 && !(s__hit == 0)) && blastFlag == 3) RESULT: Ultimate proved your program to be correct! [2021-12-15 21:59:24,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE