./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_clnt_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_clnt_2.cil-2.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 e8a8eb6c750c607e2f549ecc5582c4aebf9571fc15330f2a7e0973b7c96cc082 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:45:40,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:45:40,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:45:40,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:45:40,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:45:40,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:45:40,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:45:40,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:45:40,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:45:40,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:45:40,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:45:40,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:45:40,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:45:40,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:45:40,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:45:40,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:45:40,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:45:40,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:45:40,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:45:40,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:45:40,437 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:45:40,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:45:40,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:45:40,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:45:40,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:45:40,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:45:40,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:45:40,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:45:40,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:45:40,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:45:40,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:45:40,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:45:40,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:45:40,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:45:40,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:45:40,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:45:40,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:45:40,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:45:40,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:45:40,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:45:40,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:45:40,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:45:40,455 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:45:40,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:45:40,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:45:40,473 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:45:40,473 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:45:40,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:45:40,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:45:40,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:45:40,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:45:40,474 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:45:40,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:45:40,475 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:45:40,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:45:40,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:45:40,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:45:40,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:45:40,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:45:40,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:45:40,475 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:45:40,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:45:40,476 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:45:40,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:45:40,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:45:40,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:45:40,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:45:40,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:45:40,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:45:40,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:45:40,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:45:40,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:45:40,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:45:40,477 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:45:40,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:45:40,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:45:40,477 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 -> e8a8eb6c750c607e2f549ecc5582c4aebf9571fc15330f2a7e0973b7c96cc082 [2022-07-11 23:45:40,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:45:40,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:45:40,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:45:40,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:45:40,678 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:45:40,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_clnt_2.cil-2.c [2022-07-11 23:45:40,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0647e98/00d6acbbad5044e7908d6607888c5314/FLAGcc2684191 [2022-07-11 23:45:41,093 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:45:41,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_2.cil-2.c [2022-07-11 23:45:41,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0647e98/00d6acbbad5044e7908d6607888c5314/FLAGcc2684191 [2022-07-11 23:45:41,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0647e98/00d6acbbad5044e7908d6607888c5314 [2022-07-11 23:45:41,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:45:41,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:45:41,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:45:41,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:45:41,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:45:41,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:45:41" (1/1) ... [2022-07-11 23:45:41,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28dabbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41, skipping insertion in model container [2022-07-11 23:45:41,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:45:41" (1/1) ... [2022-07-11 23:45:41,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:45:41,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:45:41,704 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_clnt_2.cil-2.c[35827,35840] [2022-07-11 23:45:41,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:45:41,713 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:45:41,746 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_clnt_2.cil-2.c[35827,35840] [2022-07-11 23:45:41,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:45:41,771 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:45:41,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41 WrapperNode [2022-07-11 23:45:41,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:45:41,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:45:41,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:45:41,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:45:41,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41" (1/1) ... [2022-07-11 23:45:41,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41" (1/1) ... [2022-07-11 23:45:41,818 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 504 [2022-07-11 23:45:41,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:45:41,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:45:41,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:45:41,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:45:41,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41" (1/1) ... [2022-07-11 23:45:41,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41" (1/1) ... [2022-07-11 23:45:41,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41" (1/1) ... [2022-07-11 23:45:41,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41" (1/1) ... [2022-07-11 23:45:41,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41" (1/1) ... [2022-07-11 23:45:41,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41" (1/1) ... [2022-07-11 23:45:41,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41" (1/1) ... [2022-07-11 23:45:41,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:45:41,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:45:41,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:45:41,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:45:41,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41" (1/1) ... [2022-07-11 23:45:41,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:45:41,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:41,904 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) [2022-07-11 23:45:41,905 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 [2022-07-11 23:45:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:45:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:45:41,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:45:41,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:45:42,001 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:45:42,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:45:42,020 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:45:42,313 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-11 23:45:42,314 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-11 23:45:42,314 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:45:42,319 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:45:42,319 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:45:42,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:45:42 BoogieIcfgContainer [2022-07-11 23:45:42,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:45:42,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:45:42,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:45:42,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:45:42,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:45:41" (1/3) ... [2022-07-11 23:45:42,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac4d125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:45:42, skipping insertion in model container [2022-07-11 23:45:42,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:41" (2/3) ... [2022-07-11 23:45:42,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac4d125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:45:42, skipping insertion in model container [2022-07-11 23:45:42,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:45:42" (3/3) ... [2022-07-11 23:45:42,326 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2022-07-11 23:45:42,336 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:45:42,336 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:45:42,375 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:45:42,381 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53a2d560, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b0a1bd4 [2022-07-11 23:45:42,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:45:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 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) [2022-07-11 23:45:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:45:42,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:42,400 INFO L195 NwaCegarLoop]: 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] [2022-07-11 23:45:42,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:42,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695038, now seen corresponding path program 1 times [2022-07-11 23:45:42,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:42,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796875666] [2022-07-11 23:45:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:45:42,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:42,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796875666] [2022-07-11 23:45:42,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796875666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:42,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:42,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361793516] [2022-07-11 23:45:42,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:42,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:42,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:42,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:42,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:42,606 INFO L87 Difference]: Start difference. First operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-07-11 23:45:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:42,744 INFO L93 Difference]: Finished difference Result 252 states and 427 transitions. [2022-07-11 23:45:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-07-11 23:45:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:42,757 INFO L225 Difference]: With dead ends: 252 [2022-07-11 23:45:42,758 INFO L226 Difference]: Without dead ends: 115 [2022-07-11 23:45:42,770 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:42,773 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:42,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 325 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:42,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-11 23:45:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-07-11 23:45:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 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) [2022-07-11 23:45:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-07-11 23:45:42,812 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-07-11 23:45:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:42,812 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-07-11 23:45:42,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-07-11 23:45:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-07-11 23:45:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:45:42,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:42,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:42,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:45:42,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:42,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash 561717339, now seen corresponding path program 1 times [2022-07-11 23:45:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:42,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110493967] [2022-07-11 23:45:42,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:42,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:45:42,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:42,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110493967] [2022-07-11 23:45:42,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110493967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:42,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:42,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:42,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775556667] [2022-07-11 23:45:42,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:42,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:42,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:42,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:42,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:42,891 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2022-07-11 23:45:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:42,971 INFO L93 Difference]: Finished difference Result 239 states and 362 transitions. [2022-07-11 23:45:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:42,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2022-07-11 23:45:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:42,975 INFO L225 Difference]: With dead ends: 239 [2022-07-11 23:45:42,975 INFO L226 Difference]: Without dead ends: 134 [2022-07-11 23:45:42,979 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:42,981 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 15 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:42,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 244 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-11 23:45:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2022-07-11 23:45:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.4883720930232558) internal successors, (192), 129 states have internal predecessors, (192), 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) [2022-07-11 23:45:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 192 transitions. [2022-07-11 23:45:43,003 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 192 transitions. Word has length 37 [2022-07-11 23:45:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:43,003 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 192 transitions. [2022-07-11 23:45:43,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2022-07-11 23:45:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 192 transitions. [2022-07-11 23:45:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-11 23:45:43,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:43,004 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:43,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:45:43,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:43,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:43,005 INFO L85 PathProgramCache]: Analyzing trace with hash 684962052, now seen corresponding path program 1 times [2022-07-11 23:45:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:43,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925087210] [2022-07-11 23:45:43,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:43,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 23:45:43,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:43,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925087210] [2022-07-11 23:45:43,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925087210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:43,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:43,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:43,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054961103] [2022-07-11 23:45:43,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:43,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:43,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:43,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:43,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:43,065 INFO L87 Difference]: Start difference. First operand 130 states and 192 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2022-07-11 23:45:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:43,147 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2022-07-11 23:45:43,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:43,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 51 [2022-07-11 23:45:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:43,150 INFO L225 Difference]: With dead ends: 271 [2022-07-11 23:45:43,150 INFO L226 Difference]: Without dead ends: 151 [2022-07-11 23:45:43,154 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:43,158 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 15 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:43,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 257 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-11 23:45:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2022-07-11 23:45:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4657534246575343) internal successors, (214), 146 states have internal predecessors, (214), 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) [2022-07-11 23:45:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 214 transitions. [2022-07-11 23:45:43,169 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 214 transitions. Word has length 51 [2022-07-11 23:45:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:43,169 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 214 transitions. [2022-07-11 23:45:43,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2022-07-11 23:45:43,169 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 214 transitions. [2022-07-11 23:45:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-11 23:45:43,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:43,170 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:43,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:45:43,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:43,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:43,171 INFO L85 PathProgramCache]: Analyzing trace with hash -184561774, now seen corresponding path program 1 times [2022-07-11 23:45:43,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:43,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474694437] [2022-07-11 23:45:43,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:43,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:45:43,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:43,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474694437] [2022-07-11 23:45:43,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474694437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:43,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:43,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:43,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340579091] [2022-07-11 23:45:43,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:43,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:43,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:43,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:43,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:43,240 INFO L87 Difference]: Start difference. First operand 147 states and 214 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-07-11 23:45:43,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:43,356 INFO L93 Difference]: Finished difference Result 335 states and 503 transitions. [2022-07-11 23:45:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:43,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 68 [2022-07-11 23:45:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:43,359 INFO L225 Difference]: With dead ends: 335 [2022-07-11 23:45:43,359 INFO L226 Difference]: Without dead ends: 197 [2022-07-11 23:45:43,360 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:43,364 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 53 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:43,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 231 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:43,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-11 23:45:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-07-11 23:45:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.411764705882353) internal successors, (264), 187 states have internal predecessors, (264), 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) [2022-07-11 23:45:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2022-07-11 23:45:43,380 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 68 [2022-07-11 23:45:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:43,382 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2022-07-11 23:45:43,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-07-11 23:45:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2022-07-11 23:45:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-11 23:45:43,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:43,385 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:43,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:45:43,385 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:43,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:43,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1990000108, now seen corresponding path program 1 times [2022-07-11 23:45:43,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:43,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921845205] [2022-07-11 23:45:43,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:43,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:45:43,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:43,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921845205] [2022-07-11 23:45:43,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921845205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:43,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:43,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:43,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487135053] [2022-07-11 23:45:43,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:43,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:43,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:43,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:43,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:43,470 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-07-11 23:45:43,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:43,537 INFO L93 Difference]: Finished difference Result 390 states and 555 transitions. [2022-07-11 23:45:43,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:43,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 68 [2022-07-11 23:45:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:43,539 INFO L225 Difference]: With dead ends: 390 [2022-07-11 23:45:43,539 INFO L226 Difference]: Without dead ends: 212 [2022-07-11 23:45:43,539 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:43,540 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 16 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:43,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 262 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-11 23:45:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2022-07-11 23:45:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.3980582524271845) internal successors, (288), 206 states have internal predecessors, (288), 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) [2022-07-11 23:45:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2022-07-11 23:45:43,551 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 68 [2022-07-11 23:45:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:43,551 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2022-07-11 23:45:43,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-07-11 23:45:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2022-07-11 23:45:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-11 23:45:43,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:43,553 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:43,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:45:43,553 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:43,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash -843012112, now seen corresponding path program 1 times [2022-07-11 23:45:43,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:43,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527092202] [2022-07-11 23:45:43,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:43,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-11 23:45:43,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:43,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527092202] [2022-07-11 23:45:43,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527092202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:43,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:43,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:43,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423870124] [2022-07-11 23:45:43,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:43,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:43,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:43,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:43,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:43,606 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2022-07-11 23:45:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:43,693 INFO L93 Difference]: Finished difference Result 428 states and 604 transitions. [2022-07-11 23:45:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:43,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 85 [2022-07-11 23:45:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:43,696 INFO L225 Difference]: With dead ends: 428 [2022-07-11 23:45:43,696 INFO L226 Difference]: Without dead ends: 231 [2022-07-11 23:45:43,696 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:43,697 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:43,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 261 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-11 23:45:43,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2022-07-11 23:45:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.3832599118942732) internal successors, (314), 227 states have internal predecessors, (314), 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) [2022-07-11 23:45:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 314 transitions. [2022-07-11 23:45:43,705 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 314 transitions. Word has length 85 [2022-07-11 23:45:43,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:43,706 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 314 transitions. [2022-07-11 23:45:43,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2022-07-11 23:45:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 314 transitions. [2022-07-11 23:45:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-11 23:45:43,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:43,714 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:43,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:45:43,714 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:43,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:43,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1725839848, now seen corresponding path program 1 times [2022-07-11 23:45:43,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:43,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429236476] [2022-07-11 23:45:43,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-11 23:45:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:43,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429236476] [2022-07-11 23:45:43,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429236476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:43,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:43,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:43,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933336175] [2022-07-11 23:45:43,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:43,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:43,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:43,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:43,778 INFO L87 Difference]: Start difference. First operand 228 states and 314 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2022-07-11 23:45:43,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:43,797 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2022-07-11 23:45:43,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:43,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 105 [2022-07-11 23:45:43,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:43,799 INFO L225 Difference]: With dead ends: 661 [2022-07-11 23:45:43,799 INFO L226 Difference]: Without dead ends: 443 [2022-07-11 23:45:43,800 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:43,800 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 125 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:43,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 363 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-07-11 23:45:43,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2022-07-11 23:45:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.3710407239819005) internal successors, (606), 442 states have internal predecessors, (606), 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) [2022-07-11 23:45:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 606 transitions. [2022-07-11 23:45:43,808 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 606 transitions. Word has length 105 [2022-07-11 23:45:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:43,808 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 606 transitions. [2022-07-11 23:45:43,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2022-07-11 23:45:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 606 transitions. [2022-07-11 23:45:43,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-11 23:45:43,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:43,810 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:43,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:45:43,810 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:43,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1889855194, now seen corresponding path program 1 times [2022-07-11 23:45:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:43,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668413532] [2022-07-11 23:45:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:43,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-11 23:45:43,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668413532] [2022-07-11 23:45:43,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668413532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:43,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:43,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:43,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920678788] [2022-07-11 23:45:43,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:43,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:43,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:43,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:43,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:43,883 INFO L87 Difference]: Start difference. First operand 443 states and 606 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2022-07-11 23:45:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:43,899 INFO L93 Difference]: Finished difference Result 897 states and 1226 transitions. [2022-07-11 23:45:43,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:43,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 105 [2022-07-11 23:45:43,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:43,901 INFO L225 Difference]: With dead ends: 897 [2022-07-11 23:45:43,901 INFO L226 Difference]: Without dead ends: 464 [2022-07-11 23:45:43,901 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:43,902 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:43,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 343 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-07-11 23:45:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2022-07-11 23:45:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.367170626349892) internal successors, (633), 463 states have internal predecessors, (633), 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) [2022-07-11 23:45:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 633 transitions. [2022-07-11 23:45:43,913 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 633 transitions. Word has length 105 [2022-07-11 23:45:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:43,914 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 633 transitions. [2022-07-11 23:45:43,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2022-07-11 23:45:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 633 transitions. [2022-07-11 23:45:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-11 23:45:43,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:43,918 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:43,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:45:43,919 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:43,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:43,920 INFO L85 PathProgramCache]: Analyzing trace with hash -810746188, now seen corresponding path program 1 times [2022-07-11 23:45:43,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:43,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142625298] [2022-07-11 23:45:43,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:43,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-11 23:45:43,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:43,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142625298] [2022-07-11 23:45:43,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142625298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:43,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:43,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:43,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729654221] [2022-07-11 23:45:43,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:43,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:43,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:43,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:43,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:43,962 INFO L87 Difference]: Start difference. First operand 464 states and 633 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) [2022-07-11 23:45:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:43,976 INFO L93 Difference]: Finished difference Result 945 states and 1287 transitions. [2022-07-11 23:45:43,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:43,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 106 [2022-07-11 23:45:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:43,978 INFO L225 Difference]: With dead ends: 945 [2022-07-11 23:45:43,979 INFO L226 Difference]: Without dead ends: 491 [2022-07-11 23:45:43,979 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:43,980 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 20 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:43,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 315 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-11 23:45:43,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-07-11 23:45:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.3612244897959183) internal successors, (667), 490 states have internal predecessors, (667), 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) [2022-07-11 23:45:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 667 transitions. [2022-07-11 23:45:43,991 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 667 transitions. Word has length 106 [2022-07-11 23:45:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:43,992 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 667 transitions. [2022-07-11 23:45:43,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) [2022-07-11 23:45:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 667 transitions. [2022-07-11 23:45:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-11 23:45:43,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:43,993 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:43,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:45:43,994 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:43,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:43,999 INFO L85 PathProgramCache]: Analyzing trace with hash 625791090, now seen corresponding path program 1 times [2022-07-11 23:45:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:44,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512302308] [2022-07-11 23:45:44,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:44,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-11 23:45:44,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:44,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512302308] [2022-07-11 23:45:44,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512302308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:44,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:44,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:44,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560234078] [2022-07-11 23:45:44,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:44,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:44,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:44,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:44,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:44,039 INFO L87 Difference]: Start difference. First operand 491 states and 667 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) [2022-07-11 23:45:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:44,059 INFO L93 Difference]: Finished difference Result 709 states and 967 transitions. [2022-07-11 23:45:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:44,060 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 107 [2022-07-11 23:45:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:44,062 INFO L225 Difference]: With dead ends: 709 [2022-07-11 23:45:44,062 INFO L226 Difference]: Without dead ends: 707 [2022-07-11 23:45:44,062 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:44,063 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 139 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:44,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 305 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-07-11 23:45:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2022-07-11 23:45:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.36685552407932) internal successors, (965), 706 states have internal predecessors, (965), 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) [2022-07-11 23:45:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 965 transitions. [2022-07-11 23:45:44,076 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 965 transitions. Word has length 107 [2022-07-11 23:45:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:44,076 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 965 transitions. [2022-07-11 23:45:44,076 INFO L496 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) [2022-07-11 23:45:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 965 transitions. [2022-07-11 23:45:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-11 23:45:44,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:44,078 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:44,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:45:44,079 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:44,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1290635395, now seen corresponding path program 1 times [2022-07-11 23:45:44,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:44,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039048939] [2022-07-11 23:45:44,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:44,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-07-11 23:45:44,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:44,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039048939] [2022-07-11 23:45:44,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039048939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:44,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:44,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:44,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243975171] [2022-07-11 23:45:44,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:44,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:44,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:44,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:44,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:44,111 INFO L87 Difference]: Start difference. First operand 707 states and 965 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2022-07-11 23:45:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:44,207 INFO L93 Difference]: Finished difference Result 1530 states and 2149 transitions. [2022-07-11 23:45:44,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:44,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 176 [2022-07-11 23:45:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:44,210 INFO L225 Difference]: With dead ends: 1530 [2022-07-11 23:45:44,210 INFO L226 Difference]: Without dead ends: 857 [2022-07-11 23:45:44,211 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:44,211 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 97 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:44,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 196 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2022-07-11 23:45:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 824. [2022-07-11 23:45:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.402187120291616) internal successors, (1154), 823 states have internal predecessors, (1154), 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) [2022-07-11 23:45:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1154 transitions. [2022-07-11 23:45:44,226 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1154 transitions. Word has length 176 [2022-07-11 23:45:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:44,226 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 1154 transitions. [2022-07-11 23:45:44,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2022-07-11 23:45:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1154 transitions. [2022-07-11 23:45:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-11 23:45:44,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:44,228 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:45:44,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:45:44,229 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1154586908, now seen corresponding path program 2 times [2022-07-11 23:45:44,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:44,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307842334] [2022-07-11 23:45:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-11 23:45:44,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:44,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307842334] [2022-07-11 23:45:44,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307842334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:44,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:44,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:44,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935089025] [2022-07-11 23:45:44,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:44,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:44,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:44,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:44,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:44,260 INFO L87 Difference]: Start difference. First operand 824 states and 1154 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) [2022-07-11 23:45:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:44,351 INFO L93 Difference]: Finished difference Result 1892 states and 2730 transitions. [2022-07-11 23:45:44,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:44,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 189 [2022-07-11 23:45:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:44,354 INFO L225 Difference]: With dead ends: 1892 [2022-07-11 23:45:44,354 INFO L226 Difference]: Without dead ends: 1054 [2022-07-11 23:45:44,355 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:44,355 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 96 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:44,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 203 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2022-07-11 23:45:44,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1013. [2022-07-11 23:45:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.3893280632411067) internal successors, (1406), 1012 states have internal predecessors, (1406), 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) [2022-07-11 23:45:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1406 transitions. [2022-07-11 23:45:44,372 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1406 transitions. Word has length 189 [2022-07-11 23:45:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:44,372 INFO L495 AbstractCegarLoop]: Abstraction has 1013 states and 1406 transitions. [2022-07-11 23:45:44,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) [2022-07-11 23:45:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1406 transitions. [2022-07-11 23:45:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-11 23:45:44,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:44,375 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:44,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:45:44,375 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1143144718, now seen corresponding path program 1 times [2022-07-11 23:45:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:44,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177619421] [2022-07-11 23:45:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-07-11 23:45:44,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:44,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177619421] [2022-07-11 23:45:44,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177619421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:44,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:44,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:44,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60743603] [2022-07-11 23:45:44,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:44,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:44,407 INFO L87 Difference]: Start difference. First operand 1013 states and 1406 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2022-07-11 23:45:44,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:44,521 INFO L93 Difference]: Finished difference Result 2148 states and 3007 transitions. [2022-07-11 23:45:44,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:44,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 210 [2022-07-11 23:45:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:44,525 INFO L225 Difference]: With dead ends: 2148 [2022-07-11 23:45:44,525 INFO L226 Difference]: Without dead ends: 1127 [2022-07-11 23:45:44,526 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:44,526 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 99 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:44,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 199 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-07-11 23:45:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1088. [2022-07-11 23:45:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.3817847286108556) internal successors, (1502), 1087 states have internal predecessors, (1502), 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) [2022-07-11 23:45:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1502 transitions. [2022-07-11 23:45:44,549 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1502 transitions. Word has length 210 [2022-07-11 23:45:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:44,550 INFO L495 AbstractCegarLoop]: Abstraction has 1088 states and 1502 transitions. [2022-07-11 23:45:44,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2022-07-11 23:45:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1502 transitions. [2022-07-11 23:45:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-11 23:45:44,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:44,554 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:45:44,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:45:44,554 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash 455987487, now seen corresponding path program 1 times [2022-07-11 23:45:44,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:44,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032358500] [2022-07-11 23:45:44,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:44,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-07-11 23:45:44,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:44,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032358500] [2022-07-11 23:45:44,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032358500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:44,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:44,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:44,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461285169] [2022-07-11 23:45:44,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:44,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:44,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:44,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:44,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:44,595 INFO L87 Difference]: Start difference. First operand 1088 states and 1502 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2022-07-11 23:45:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:44,690 INFO L93 Difference]: Finished difference Result 2298 states and 3196 transitions. [2022-07-11 23:45:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:44,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 234 [2022-07-11 23:45:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:44,694 INFO L225 Difference]: With dead ends: 2298 [2022-07-11 23:45:44,694 INFO L226 Difference]: Without dead ends: 1208 [2022-07-11 23:45:44,695 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:44,695 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 100 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:44,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 197 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-07-11 23:45:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1172. [2022-07-11 23:45:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 1.3774551665243382) internal successors, (1613), 1171 states have internal predecessors, (1613), 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) [2022-07-11 23:45:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1613 transitions. [2022-07-11 23:45:44,715 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1613 transitions. Word has length 234 [2022-07-11 23:45:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:44,716 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1613 transitions. [2022-07-11 23:45:44,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2022-07-11 23:45:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1613 transitions. [2022-07-11 23:45:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-11 23:45:44,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:44,719 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:45:44,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:45:44,719 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:44,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:44,719 INFO L85 PathProgramCache]: Analyzing trace with hash 574428961, now seen corresponding path program 1 times [2022-07-11 23:45:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:44,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533844319] [2022-07-11 23:45:44,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:44,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-07-11 23:45:44,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:44,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533844319] [2022-07-11 23:45:44,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533844319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:44,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:44,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:44,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833325497] [2022-07-11 23:45:44,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:44,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:44,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:44,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:44,756 INFO L87 Difference]: Start difference. First operand 1172 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2022-07-11 23:45:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:44,863 INFO L93 Difference]: Finished difference Result 2466 states and 3421 transitions. [2022-07-11 23:45:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 234 [2022-07-11 23:45:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:44,867 INFO L225 Difference]: With dead ends: 2466 [2022-07-11 23:45:44,867 INFO L226 Difference]: Without dead ends: 1304 [2022-07-11 23:45:44,870 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:44,871 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 102 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:44,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 195 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-07-11 23:45:44,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1265. [2022-07-11 23:45:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3805379746835442) internal successors, (1745), 1264 states have internal predecessors, (1745), 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) [2022-07-11 23:45:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1745 transitions. [2022-07-11 23:45:44,894 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1745 transitions. Word has length 234 [2022-07-11 23:45:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:44,894 INFO L495 AbstractCegarLoop]: Abstraction has 1265 states and 1745 transitions. [2022-07-11 23:45:44,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2022-07-11 23:45:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1745 transitions. [2022-07-11 23:45:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-07-11 23:45:44,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:44,897 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 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, 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] [2022-07-11 23:45:44,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:45:44,897 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:44,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash 172133823, now seen corresponding path program 1 times [2022-07-11 23:45:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:44,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358509501] [2022-07-11 23:45:44,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:44,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-07-11 23:45:44,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:44,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358509501] [2022-07-11 23:45:44,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358509501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:44,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:44,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:44,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422429912] [2022-07-11 23:45:44,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:44,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:44,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:44,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:44,954 INFO L87 Difference]: Start difference. First operand 1265 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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) [2022-07-11 23:45:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:44,987 INFO L93 Difference]: Finished difference Result 3718 states and 5136 transitions. [2022-07-11 23:45:44,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:44,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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 264 [2022-07-11 23:45:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:44,994 INFO L225 Difference]: With dead ends: 3718 [2022-07-11 23:45:44,994 INFO L226 Difference]: Without dead ends: 2490 [2022-07-11 23:45:44,996 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:44,996 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:44,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 483 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2022-07-11 23:45:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2488. [2022-07-11 23:45:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2487 states have (on average 1.3811821471652594) internal successors, (3435), 2487 states have internal predecessors, (3435), 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) [2022-07-11 23:45:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3435 transitions. [2022-07-11 23:45:45,049 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3435 transitions. Word has length 264 [2022-07-11 23:45:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:45,049 INFO L495 AbstractCegarLoop]: Abstraction has 2488 states and 3435 transitions. [2022-07-11 23:45:45,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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) [2022-07-11 23:45:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3435 transitions. [2022-07-11 23:45:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-07-11 23:45:45,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:45,063 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 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, 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] [2022-07-11 23:45:45,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:45:45,064 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:45,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 290575297, now seen corresponding path program 1 times [2022-07-11 23:45:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:45,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717465077] [2022-07-11 23:45:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:45,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2022-07-11 23:45:45,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:45,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717465077] [2022-07-11 23:45:45,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717465077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:45,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:45,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:45,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888951882] [2022-07-11 23:45:45,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:45,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:45,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:45,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:45,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:45,115 INFO L87 Difference]: Start difference. First operand 2488 states and 3435 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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) [2022-07-11 23:45:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:45,227 INFO L93 Difference]: Finished difference Result 5251 states and 7296 transitions. [2022-07-11 23:45:45,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:45,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 264 [2022-07-11 23:45:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:45,234 INFO L225 Difference]: With dead ends: 5251 [2022-07-11 23:45:45,234 INFO L226 Difference]: Without dead ends: 2770 [2022-07-11 23:45:45,237 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:45,237 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 117 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:45,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 177 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2022-07-11 23:45:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2698. [2022-07-11 23:45:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2698 states, 2697 states have (on average 1.389321468298109) internal successors, (3747), 2697 states have internal predecessors, (3747), 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) [2022-07-11 23:45:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3747 transitions. [2022-07-11 23:45:45,288 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3747 transitions. Word has length 264 [2022-07-11 23:45:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:45,289 INFO L495 AbstractCegarLoop]: Abstraction has 2698 states and 3747 transitions. [2022-07-11 23:45:45,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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) [2022-07-11 23:45:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3747 transitions. [2022-07-11 23:45:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-07-11 23:45:45,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:45,293 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:45:45,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:45:45,293 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:45,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1239310138, now seen corresponding path program 1 times [2022-07-11 23:45:45,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:45,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948474045] [2022-07-11 23:45:45,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:45,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-11 23:45:45,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:45,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948474045] [2022-07-11 23:45:45,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948474045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:45,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:45,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:45,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506595423] [2022-07-11 23:45:45,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:45,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:45,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:45,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:45,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:45,342 INFO L87 Difference]: Start difference. First operand 2698 states and 3747 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2022-07-11 23:45:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:45,462 INFO L93 Difference]: Finished difference Result 5443 states and 7548 transitions. [2022-07-11 23:45:45,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:45,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 299 [2022-07-11 23:45:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:45,470 INFO L225 Difference]: With dead ends: 5443 [2022-07-11 23:45:45,470 INFO L226 Difference]: Without dead ends: 2764 [2022-07-11 23:45:45,473 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:45,473 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 122 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:45,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 170 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2022-07-11 23:45:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2692. [2022-07-11 23:45:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2691 states have (on average 1.379041248606466) internal successors, (3711), 2691 states have internal predecessors, (3711), 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) [2022-07-11 23:45:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 3711 transitions. [2022-07-11 23:45:45,523 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 3711 transitions. Word has length 299 [2022-07-11 23:45:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:45,523 INFO L495 AbstractCegarLoop]: Abstraction has 2692 states and 3711 transitions. [2022-07-11 23:45:45,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2022-07-11 23:45:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3711 transitions. [2022-07-11 23:45:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-07-11 23:45:45,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:45,528 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:45,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:45:45,529 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:45,529 INFO L85 PathProgramCache]: Analyzing trace with hash 918915254, now seen corresponding path program 1 times [2022-07-11 23:45:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:45,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937995901] [2022-07-11 23:45:45,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-07-11 23:45:45,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:45,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937995901] [2022-07-11 23:45:45,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937995901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:45,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:45,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:45,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790586530] [2022-07-11 23:45:45,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:45,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:45,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:45,574 INFO L87 Difference]: Start difference. First operand 2692 states and 3711 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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) [2022-07-11 23:45:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:45,678 INFO L93 Difference]: Finished difference Result 5407 states and 7446 transitions. [2022-07-11 23:45:45,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:45,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 322 [2022-07-11 23:45:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:45,686 INFO L225 Difference]: With dead ends: 5407 [2022-07-11 23:45:45,686 INFO L226 Difference]: Without dead ends: 2752 [2022-07-11 23:45:45,689 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:45,689 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 55 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:45,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 251 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:45,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2022-07-11 23:45:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2692. [2022-07-11 23:45:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2691 states have (on average 1.358974358974359) internal successors, (3657), 2691 states have internal predecessors, (3657), 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) [2022-07-11 23:45:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 3657 transitions. [2022-07-11 23:45:45,768 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 3657 transitions. Word has length 322 [2022-07-11 23:45:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:45,768 INFO L495 AbstractCegarLoop]: Abstraction has 2692 states and 3657 transitions. [2022-07-11 23:45:45,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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) [2022-07-11 23:45:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3657 transitions. [2022-07-11 23:45:45,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2022-07-11 23:45:45,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:45,773 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:45:45,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:45:45,774 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:45,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:45,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1665023372, now seen corresponding path program 1 times [2022-07-11 23:45:45,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:45,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373227637] [2022-07-11 23:45:45,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:45,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-11 23:45:45,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:45,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373227637] [2022-07-11 23:45:45,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373227637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:45,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:45,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:45,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316294872] [2022-07-11 23:45:45,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:45,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:45,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:45,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:45,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:45,822 INFO L87 Difference]: Start difference. First operand 2692 states and 3657 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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) [2022-07-11 23:45:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:45,932 INFO L93 Difference]: Finished difference Result 5653 states and 7626 transitions. [2022-07-11 23:45:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:45,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 336 [2022-07-11 23:45:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:45,940 INFO L225 Difference]: With dead ends: 5653 [2022-07-11 23:45:45,940 INFO L226 Difference]: Without dead ends: 2998 [2022-07-11 23:45:45,942 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:45,943 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 130 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:45,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 147 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-07-11 23:45:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2782. [2022-07-11 23:45:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2781 states have (on average 1.3581445523193096) internal successors, (3777), 2781 states have internal predecessors, (3777), 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) [2022-07-11 23:45:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 3777 transitions. [2022-07-11 23:45:46,027 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 3777 transitions. Word has length 336 [2022-07-11 23:45:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:46,028 INFO L495 AbstractCegarLoop]: Abstraction has 2782 states and 3777 transitions. [2022-07-11 23:45:46,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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) [2022-07-11 23:45:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 3777 transitions. [2022-07-11 23:45:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-07-11 23:45:46,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:46,033 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:45:46,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:45:46,033 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:46,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:46,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1597112402, now seen corresponding path program 1 times [2022-07-11 23:45:46,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:46,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412579336] [2022-07-11 23:45:46,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:46,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2022-07-11 23:45:46,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:46,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412579336] [2022-07-11 23:45:46,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412579336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:46,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:46,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:46,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325656930] [2022-07-11 23:45:46,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:46,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:46,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:46,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:46,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:46,086 INFO L87 Difference]: Start difference. First operand 2782 states and 3777 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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) [2022-07-11 23:45:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:46,141 INFO L93 Difference]: Finished difference Result 7882 states and 10755 transitions. [2022-07-11 23:45:46,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:46,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 337 [2022-07-11 23:45:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:46,155 INFO L225 Difference]: With dead ends: 7882 [2022-07-11 23:45:46,155 INFO L226 Difference]: Without dead ends: 5137 [2022-07-11 23:45:46,158 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:46,159 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 84 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 445 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 [2022-07-11 23:45:46,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 445 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2022-07-11 23:45:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 5135. [2022-07-11 23:45:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5135 states, 5134 states have (on average 1.36482275029217) internal successors, (7007), 5134 states have internal predecessors, (7007), 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) [2022-07-11 23:45:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5135 states to 5135 states and 7007 transitions. [2022-07-11 23:45:46,287 INFO L78 Accepts]: Start accepts. Automaton has 5135 states and 7007 transitions. Word has length 337 [2022-07-11 23:45:46,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:46,287 INFO L495 AbstractCegarLoop]: Abstraction has 5135 states and 7007 transitions. [2022-07-11 23:45:46,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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) [2022-07-11 23:45:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5135 states and 7007 transitions. [2022-07-11 23:45:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2022-07-11 23:45:46,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:46,295 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:46,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:45:46,295 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:46,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1354743787, now seen corresponding path program 1 times [2022-07-11 23:45:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:46,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042324576] [2022-07-11 23:45:46,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-07-11 23:45:46,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:46,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042324576] [2022-07-11 23:45:46,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042324576] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:45:46,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101653142] [2022-07-11 23:45:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:46,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:46,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:46,376 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) [2022-07-11 23:45:46,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:45:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:46,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:45:46,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-07-11 23:45:46,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:45:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-07-11 23:45:46,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101653142] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:45:46,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:45:46,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-11 23:45:46,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496058137] [2022-07-11 23:45:46,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:45:46,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:45:46,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:46,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:45:46,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:45:46,717 INFO L87 Difference]: Start difference. First operand 5135 states and 7007 transitions. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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) [2022-07-11 23:45:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:47,099 INFO L93 Difference]: Finished difference Result 10227 states and 13933 transitions. [2022-07-11 23:45:47,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:45:47,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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 361 [2022-07-11 23:45:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:47,112 INFO L225 Difference]: With dead ends: 10227 [2022-07-11 23:45:47,112 INFO L226 Difference]: Without dead ends: 7740 [2022-07-11 23:45:47,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:45:47,116 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 422 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:47,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 613 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:45:47,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7740 states. [2022-07-11 23:45:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7740 to 5669. [2022-07-11 23:45:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5669 states, 5668 states have (on average 1.3484474241354976) internal successors, (7643), 5668 states have internal predecessors, (7643), 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) [2022-07-11 23:45:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5669 states to 5669 states and 7643 transitions. [2022-07-11 23:45:47,220 INFO L78 Accepts]: Start accepts. Automaton has 5669 states and 7643 transitions. Word has length 361 [2022-07-11 23:45:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:47,220 INFO L495 AbstractCegarLoop]: Abstraction has 5669 states and 7643 transitions. [2022-07-11 23:45:47,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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) [2022-07-11 23:45:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 5669 states and 7643 transitions. [2022-07-11 23:45:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-07-11 23:45:47,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:47,228 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:47,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-11 23:45:47,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-11 23:45:47,444 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:47,444 INFO L85 PathProgramCache]: Analyzing trace with hash 290805068, now seen corresponding path program 2 times [2022-07-11 23:45:47,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:47,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624483512] [2022-07-11 23:45:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:47,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-11 23:45:47,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:47,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624483512] [2022-07-11 23:45:47,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624483512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:45:47,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862305427] [2022-07-11 23:45:47,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:45:47,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:47,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:47,541 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) [2022-07-11 23:45:47,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:45:47,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:45:47,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:45:47,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:45:47,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-11 23:45:47,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:45:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-11 23:45:47,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862305427] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:45:47,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:45:47,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-11 23:45:47,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008639071] [2022-07-11 23:45:47,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:45:47,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:45:47,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:47,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:45:47,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:45:47,758 INFO L87 Difference]: Start difference. First operand 5669 states and 7643 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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) [2022-07-11 23:45:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:47,982 INFO L93 Difference]: Finished difference Result 12703 states and 17150 transitions. [2022-07-11 23:45:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:45:47,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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 374 [2022-07-11 23:45:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:47,993 INFO L225 Difference]: With dead ends: 12703 [2022-07-11 23:45:47,993 INFO L226 Difference]: Without dead ends: 7058 [2022-07-11 23:45:48,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:45:48,001 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 346 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:48,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 364 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2022-07-11 23:45:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 5789. [2022-07-11 23:45:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5789 states, 5788 states have (on average 1.3344851416724257) internal successors, (7724), 5788 states have internal predecessors, (7724), 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) [2022-07-11 23:45:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7724 transitions. [2022-07-11 23:45:48,127 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7724 transitions. Word has length 374 [2022-07-11 23:45:48,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:48,128 INFO L495 AbstractCegarLoop]: Abstraction has 5789 states and 7724 transitions. [2022-07-11 23:45:48,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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) [2022-07-11 23:45:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7724 transitions. [2022-07-11 23:45:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2022-07-11 23:45:48,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:48,136 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:48,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:45:48,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-11 23:45:48,358 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:48,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash -939951161, now seen corresponding path program 1 times [2022-07-11 23:45:48,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:48,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594309461] [2022-07-11 23:45:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:48,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-07-11 23:45:48,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:48,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594309461] [2022-07-11 23:45:48,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594309461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:48,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:48,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:48,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597555780] [2022-07-11 23:45:48,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:48,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:48,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:48,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:48,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:48,418 INFO L87 Difference]: Start difference. First operand 5789 states and 7724 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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) [2022-07-11 23:45:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:48,563 INFO L93 Difference]: Finished difference Result 11133 states and 14642 transitions. [2022-07-11 23:45:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:48,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 413 [2022-07-11 23:45:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:48,568 INFO L225 Difference]: With dead ends: 11133 [2022-07-11 23:45:48,569 INFO L226 Difference]: Without dead ends: 3109 [2022-07-11 23:45:48,576 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:45:48,577 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:48,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 259 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:48,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2022-07-11 23:45:48,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 3043. [2022-07-11 23:45:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 3042 states have (on average 1.3356344510190663) internal successors, (4063), 3042 states have internal predecessors, (4063), 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) [2022-07-11 23:45:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4063 transitions. [2022-07-11 23:45:48,642 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4063 transitions. Word has length 413 [2022-07-11 23:45:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:48,643 INFO L495 AbstractCegarLoop]: Abstraction has 3043 states and 4063 transitions. [2022-07-11 23:45:48,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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) [2022-07-11 23:45:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4063 transitions. [2022-07-11 23:45:48,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2022-07-11 23:45:48,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:48,651 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:48,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:45:48,652 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:48,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:48,652 INFO L85 PathProgramCache]: Analyzing trace with hash -826650578, now seen corresponding path program 1 times [2022-07-11 23:45:48,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:48,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861490559] [2022-07-11 23:45:48,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:48,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2022-07-11 23:45:48,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:48,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861490559] [2022-07-11 23:45:48,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861490559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:45:48,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300208153] [2022-07-11 23:45:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:48,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:48,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:48,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:45:48,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:45:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:48,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:45:48,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2022-07-11 23:45:49,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:45:49,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300208153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:49,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:45:49,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:45:49,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357438969] [2022-07-11 23:45:49,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:49,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:49,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:49,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:49,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:45:49,310 INFO L87 Difference]: Start difference. First operand 3043 states and 4063 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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) [2022-07-11 23:45:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:49,339 INFO L93 Difference]: Finished difference Result 3068 states and 4093 transitions. [2022-07-11 23:45:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:49,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 511 [2022-07-11 23:45:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:49,343 INFO L225 Difference]: With dead ends: 3068 [2022-07-11 23:45:49,343 INFO L226 Difference]: Without dead ends: 2571 [2022-07-11 23:45:49,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:45:49,344 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 56 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:49,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 256 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-07-11 23:45:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2548. [2022-07-11 23:45:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 2547 states have (on average 1.3345111896348645) internal successors, (3399), 2547 states have internal predecessors, (3399), 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) [2022-07-11 23:45:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3399 transitions. [2022-07-11 23:45:49,394 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3399 transitions. Word has length 511 [2022-07-11 23:45:49,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:49,394 INFO L495 AbstractCegarLoop]: Abstraction has 2548 states and 3399 transitions. [2022-07-11 23:45:49,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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) [2022-07-11 23:45:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3399 transitions. [2022-07-11 23:45:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2022-07-11 23:45:49,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:49,399 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 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, 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] [2022-07-11 23:45:49,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:45:49,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:49,607 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:49,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash -301655084, now seen corresponding path program 1 times [2022-07-11 23:45:49,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:49,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951393018] [2022-07-11 23:45:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:49,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 1623 proven. 14 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2022-07-11 23:45:49,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:49,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951393018] [2022-07-11 23:45:49,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951393018] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:45:49,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548576334] [2022-07-11 23:45:49,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:49,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:49,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:49,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:45:49,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:45:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:49,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:45:49,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2022-07-11 23:45:49,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:45:49,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548576334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:49,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:45:49,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:45:49,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243736567] [2022-07-11 23:45:49,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:49,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:49,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:49,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:49,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:45:49,844 INFO L87 Difference]: Start difference. First operand 2548 states and 3399 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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) [2022-07-11 23:45:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:49,935 INFO L93 Difference]: Finished difference Result 5167 states and 6909 transitions. [2022-07-11 23:45:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:49,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 512 [2022-07-11 23:45:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:49,939 INFO L225 Difference]: With dead ends: 5167 [2022-07-11 23:45:49,939 INFO L226 Difference]: Without dead ends: 2656 [2022-07-11 23:45:49,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:45:49,942 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:49,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 207 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2022-07-11 23:45:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2653. [2022-07-11 23:45:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2652 states have (on average 1.2861990950226245) internal successors, (3411), 2652 states have internal predecessors, (3411), 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) [2022-07-11 23:45:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3411 transitions. [2022-07-11 23:45:49,984 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3411 transitions. Word has length 512 [2022-07-11 23:45:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:49,984 INFO L495 AbstractCegarLoop]: Abstraction has 2653 states and 3411 transitions. [2022-07-11 23:45:49,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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) [2022-07-11 23:45:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3411 transitions. [2022-07-11 23:45:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2022-07-11 23:45:49,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:49,989 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:50,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:45:50,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-11 23:45:50,203 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:50,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:50,204 INFO L85 PathProgramCache]: Analyzing trace with hash 44620561, now seen corresponding path program 2 times [2022-07-11 23:45:50,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:50,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906963901] [2022-07-11 23:45:50,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:50,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-07-11 23:45:50,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:50,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906963901] [2022-07-11 23:45:50,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906963901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:45:50,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873982071] [2022-07-11 23:45:50,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:45:50,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:50,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:50,267 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:45:50,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 23:45:50,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:45:50,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:45:50,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:45:50,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-07-11 23:45:50,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:45:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-07-11 23:45:50,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873982071] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:45:50,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:45:50,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-11 23:45:50,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388673855] [2022-07-11 23:45:50,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:45:50,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:45:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:50,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:45:50,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:45:50,528 INFO L87 Difference]: Start difference. First operand 2653 states and 3411 transitions. Second operand has 8 states, 8 states have (on average 41.75) internal successors, (334), 8 states have internal predecessors, (334), 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) [2022-07-11 23:45:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:50,687 INFO L93 Difference]: Finished difference Result 2888 states and 3708 transitions. [2022-07-11 23:45:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:45:50,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.75) internal successors, (334), 8 states have internal predecessors, (334), 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 623 [2022-07-11 23:45:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:50,688 INFO L225 Difference]: With dead ends: 2888 [2022-07-11 23:45:50,688 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:45:50,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1252 GetRequests, 1244 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:45:50,690 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 111 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:50,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 363 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:50,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:45:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:45:50,691 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) [2022-07-11 23:45:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:45:50,691 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 623 [2022-07-11 23:45:50,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:50,691 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:45:50,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.75) internal successors, (334), 8 states have internal predecessors, (334), 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) [2022-07-11 23:45:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:45:50,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:45:50,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:45:50,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-11 23:45:50,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-11 23:45:50,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-11 23:45:52,766 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 403) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L895 garLoopResultBuilder]: At program point L333(lines 87 562) the Hoare annotation is: false [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L399-2(lines 213 496) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 245) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L234-2(lines 213 496) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L532(lines 532 548) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L533(lines 533 547) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 370) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 337) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 304) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 239) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L302-2(lines 300 308) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 501) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 512) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 523) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 108) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L534(lines 534 539) no Hoare annotation was computed. [2022-07-11 23:45:52,767 INFO L899 garLoopResultBuilder]: For program point L534-2(lines 533 547) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L895 garLoopResultBuilder]: At program point L204(lines 200 502) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse1 .cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 (not .cse0) .cse2))) [2022-07-11 23:45:52,768 INFO L895 garLoopResultBuilder]: At program point L138(lines 134 524) the Hoare annotation is: (and (< 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 107) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 538) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 500) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L173(lines 173 511) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 522) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 377) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L372-2(lines 372 377) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L240(lines 240 243) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L895 garLoopResultBuilder]: At program point L207(lines 206 500) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse1 .cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 (not .cse0) .cse2))) [2022-07-11 23:45:52,768 INFO L895 garLoopResultBuilder]: At program point L174(lines 164 514) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4480) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L472-1(lines 472 474) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L274(lines 274 276) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L902 garLoopResultBuilder]: At program point L572(lines 564 574) the Hoare annotation is: true [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 499) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 510) no Hoare annotation was computed. [2022-07-11 23:45:52,768 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 521) no Hoare annotation was computed. [2022-07-11 23:45:52,769 INFO L899 garLoopResultBuilder]: For program point L110-1(lines 87 562) no Hoare annotation was computed. [2022-07-11 23:45:52,769 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 411) no Hoare annotation was computed. [2022-07-11 23:45:52,769 INFO L902 garLoopResultBuilder]: At program point L210(lines 209 499) the Hoare annotation is: true [2022-07-11 23:45:52,769 INFO L895 garLoopResultBuilder]: At program point L144(lines 140 522) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (< 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)))) [2022-07-11 23:45:52,769 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-07-11 23:45:52,769 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-07-11 23:45:52,769 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 445) no Hoare annotation was computed. [2022-07-11 23:45:52,770 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 346) no Hoare annotation was computed. [2022-07-11 23:45:52,770 INFO L902 garLoopResultBuilder]: At program point L212(lines 211 499) the Hoare annotation is: true [2022-07-11 23:45:52,770 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 509) no Hoare annotation was computed. [2022-07-11 23:45:52,770 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 520) no Hoare annotation was computed. [2022-07-11 23:45:52,770 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 531) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L895 garLoopResultBuilder]: At program point L180(lines 176 510) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) [2022-07-11 23:45:52,771 INFO L895 garLoopResultBuilder]: At program point L114(lines 113 531) the Hoare annotation is: (and (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 480) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L478-2(lines 478 480) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L446(lines 446 450) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L446-2(lines 446 450) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 283) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L347-2(lines 347 351) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 213 496) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 508) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 519) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 530) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L895 garLoopResultBuilder]: At program point L150(lines 146 520) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (< 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 318) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L250(lines 250 253) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L316-2(lines 213 496) no Hoare annotation was computed. [2022-07-11 23:45:52,771 INFO L899 garLoopResultBuilder]: For program point L416(lines 416 418) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 385) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L895 garLoopResultBuilder]: At program point L218(lines 116 530) the Hoare annotation is: (and (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 507) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 518) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 529) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L895 garLoopResultBuilder]: At program point L186(lines 182 508) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 486) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L484-2(lines 484 486) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L902 garLoopResultBuilder]: At program point L551(lines 109 552) the Hoare annotation is: true [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L287(lines 287 291) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L287-2(lines 287 291) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 506) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 517) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 528) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L895 garLoopResultBuilder]: At program point L156(lines 152 518) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4448) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 225) no Hoare annotation was computed. [2022-07-11 23:45:52,772 INFO L899 garLoopResultBuilder]: For program point L223-2(lines 223 225) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 505) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 516) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 527) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 491) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L456(lines 456 467) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 437) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 423 437) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L456-2(lines 456 467) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 327) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L895 garLoopResultBuilder]: At program point L192(lines 188 506) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) .cse0 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0))) [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 558) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L556-2(lines 556 558) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 361) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 504) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 515) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 526) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 395) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 231) no Hoare annotation was computed. [2022-07-11 23:45:52,773 INFO L895 garLoopResultBuilder]: At program point L162(lines 158 516) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4464) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 102) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 433) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L262(lines 262 268) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 464) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 503) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 514) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 525) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 560) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L902 garLoopResultBuilder]: At program point L561(lines 22 563) the Hoare annotation is: true [2022-07-11 23:45:52,774 INFO L895 garLoopResultBuilder]: At program point L198(lines 194 504) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse2) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2))) [2022-07-11 23:45:52,774 INFO L895 garLoopResultBuilder]: At program point L132(lines 128 526) the Hoare annotation is: (and (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4400) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 101) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L99-2(lines 96 102) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 308) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 267) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 298 308) no Hoare annotation was computed. [2022-07-11 23:45:52,774 INFO L899 garLoopResultBuilder]: For program point L265-2(lines 213 496) no Hoare annotation was computed. [2022-07-11 23:45:52,775 INFO L895 garLoopResultBuilder]: At program point L497(lines 110 550) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse9 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse10 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse11 (= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse12 (not .cse0)) (.cse5 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse7 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse5 .cse6) (and (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (and .cse0 .cse7 .cse8) (and .cse0 .cse3 .cse9 .cse10 .cse6) (and .cse3 .cse8) (and (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse0 .cse3 .cse2 .cse11) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse7 .cse9 .cse12 .cse10) (and .cse0 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2) (and .cse0 .cse7 .cse11) (and .cse7 .cse4 .cse12 .cse5) (and .cse7 (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse1)))) [2022-07-11 23:45:52,775 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 334) no Hoare annotation was computed. [2022-07-11 23:45:52,775 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 502) no Hoare annotation was computed. [2022-07-11 23:45:52,775 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 513) no Hoare annotation was computed. [2022-07-11 23:45:52,775 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 524) no Hoare annotation was computed. [2022-07-11 23:45:52,785 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:52,786 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:45:52,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:45:52 BoogieIcfgContainer [2022-07-11 23:45:52,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:45:52,814 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:45:52,814 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:45:52,815 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:45:52,815 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:45:42" (3/4) ... [2022-07-11 23:45:52,817 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-11 23:45:52,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-11 23:45:52,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-11 23:45:52,834 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-11 23:45:52,834 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-11 23:45:52,875 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:45:52,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:45:52,876 INFO L158 Benchmark]: Toolchain (without parser) took 11371.50ms. Allocated memory was 81.8MB in the beginning and 471.9MB in the end (delta: 390.1MB). Free memory was 38.9MB in the beginning and 177.9MB in the end (delta: -139.0MB). Peak memory consumption was 252.7MB. Max. memory is 16.1GB. [2022-07-11 23:45:52,876 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:45:52,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.29ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 38.7MB in the beginning and 85.9MB in the end (delta: -47.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2022-07-11 23:45:52,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.25ms. Allocated memory is still 119.5MB. Free memory was 85.9MB in the beginning and 83.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:45:52,876 INFO L158 Benchmark]: Boogie Preprocessor took 19.92ms. Allocated memory is still 119.5MB. Free memory was 83.0MB in the beginning and 81.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:45:52,877 INFO L158 Benchmark]: RCFGBuilder took 474.79ms. Allocated memory is still 119.5MB. Free memory was 81.3MB in the beginning and 68.5MB in the end (delta: 12.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-11 23:45:52,877 INFO L158 Benchmark]: TraceAbstraction took 10491.92ms. Allocated memory was 119.5MB in the beginning and 471.9MB in the end (delta: 352.3MB). Free memory was 67.9MB in the beginning and 185.3MB in the end (delta: -117.4MB). Peak memory consumption was 286.6MB. Max. memory is 16.1GB. [2022-07-11 23:45:52,877 INFO L158 Benchmark]: Witness Printer took 61.09ms. Allocated memory is still 471.9MB. Free memory was 185.3MB in the beginning and 177.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:45:52,878 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.16ms. Allocated memory is still 81.8MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.29ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 38.7MB in the beginning and 85.9MB in the end (delta: -47.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.25ms. Allocated memory is still 119.5MB. Free memory was 85.9MB in the beginning and 83.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.92ms. Allocated memory is still 119.5MB. Free memory was 83.0MB in the beginning and 81.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 474.79ms. Allocated memory is still 119.5MB. Free memory was 81.3MB in the beginning and 68.5MB in the end (delta: 12.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10491.92ms. Allocated memory was 119.5MB in the beginning and 471.9MB in the end (delta: 352.3MB). Free memory was 67.9MB in the beginning and 185.3MB in the end (delta: -117.4MB). Peak memory consumption was 286.6MB. Max. memory is 16.1GB. * Witness Printer took 61.09ms. Allocated memory is still 471.9MB. Free memory was 185.3MB in the beginning and 177.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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: 560]: 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, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 27, TraceHistogramMax: 22, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2566 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2566 mSDsluCounter, 7631 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2791 mSDsCounter, 668 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2841 IncrementalHoareTripleChecker+Invalid, 3509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 668 mSolverCounterUnsat, 4840 mSDtfsCounter, 2841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3827 GetRequests, 3780 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5789occurred in iteration=23, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 4069 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 426 HoareAnnotationTreeSize, 22 FomulaSimplifications, 5233 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 6976 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 8796 NumberOfCodeBlocks, 8796 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 10119 ConstructedInterpolants, 0 QuantifiedInterpolants, 13578 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4063 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 35 InterpolantComputations, 24 PerfectInterpolantSequences, 46523/46638 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: 176]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4512 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 12292 == s__state && blastFlag == 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (4384 == s__state && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 3 == s__state)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (s__s3__tmp__next_state___0 <= 4560 && 3 == s__state)) || (4368 == s__state && blastFlag == 0)) || (((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4400 == s__state)) || ((((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state)) || ((s__hit == 0 && 4416 == s__state) && blastFlag <= 4)) || ((s__hit == 0 && 2 == blastFlag) && 4400 == s__state)) || (((2 == blastFlag && s__state <= 4560) && !(s__hit == 0)) && 4560 <= s__state)) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4528) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) || (((4432 <= s__state && s__hit == 0) && s__state <= 4560) && blastFlag <= 4)) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4560) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) || ((((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: s__state <= 4352 && blastFlag == 0 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 4368 < s__state) && s__state <= 4432) && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) || (((s__hit == 0 && 4368 < s__state) && s__state <= 4432) && 2 == blastFlag) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) || (((2 == blastFlag && s__state <= 4560) && !(s__hit == 0)) && 4560 <= s__state) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (s__state < 4400 && 4352 <= s__state) && blastFlag == 0 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && s__state <= 4448) && blastFlag <= 4 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4528) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && s__state <= 4480) && blastFlag <= 4 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (4368 < s__state && !(4400 <= s__state)) && blastFlag == 1 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((s__hit == 0 && 4368 < s__state) && s__state <= 4432) && blastFlag <= 4 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4512 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && s__state <= 4464) && blastFlag <= 4 RESULT: Ultimate proved your program to be correct! [2022-07-11 23:45:52,905 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