./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.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 ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:50:15,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:50:15,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:50:15,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:50:15,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:50:15,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:50:15,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:50:15,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:50:15,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:50:15,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:50:15,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:50:15,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:50:15,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:50:15,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:50:15,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:50:15,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:50:15,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:50:15,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:50:15,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:50:15,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:50:15,893 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:50:15,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:50:15,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:50:15,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:50:15,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:50:15,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:50:15,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:50:15,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:50:15,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:50:15,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:50:15,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:50:15,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:50:15,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:50:15,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:50:15,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:50:15,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:50:15,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:50:15,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:50:15,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:50:15,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:50:15,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:50:15,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:50:15,915 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:50:15,942 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:50:15,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:50:15,942 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:50:15,943 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:50:15,943 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:50:15,944 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:50:15,944 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:50:15,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:50:15,945 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:50:15,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:50:15,945 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:50:15,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:50:15,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:50:15,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:50:15,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:50:15,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:50:15,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:50:15,947 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:50:15,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:50:15,948 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:50:15,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:50:15,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:50:15,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:50:15,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:50:15,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:50:15,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:50:15,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:50:15,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:50:15,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:50:15,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:50:15,950 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:50:15,951 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:50:15,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:50:15,951 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 -> ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e [2022-07-19 10:50:16,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:50:16,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:50:16,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:50:16,221 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:50:16,222 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:50:16,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2022-07-19 10:50:16,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6600502/af0363c0c83b4c34a8026314b9ede8d7/FLAG5a3780b8b [2022-07-19 10:50:16,690 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:50:16,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2022-07-19 10:50:16,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6600502/af0363c0c83b4c34a8026314b9ede8d7/FLAG5a3780b8b [2022-07-19 10:50:17,035 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6600502/af0363c0c83b4c34a8026314b9ede8d7 [2022-07-19 10:50:17,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:50:17,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:50:17,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:50:17,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:50:17,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:50:17,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:50:17" (1/1) ... [2022-07-19 10:50:17,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bb6058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17, skipping insertion in model container [2022-07-19 10:50:17,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:50:17" (1/1) ... [2022-07-19 10:50:17,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:50:17,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:50:17,258 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/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2022-07-19 10:50:17,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:50:17,271 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:50:17,313 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/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2022-07-19 10:50:17,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:50:17,331 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:50:17,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17 WrapperNode [2022-07-19 10:50:17,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:50:17,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:50:17,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:50:17,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:50:17,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17" (1/1) ... [2022-07-19 10:50:17,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17" (1/1) ... [2022-07-19 10:50:17,390 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 503 [2022-07-19 10:50:17,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:50:17,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:50:17,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:50:17,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:50:17,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17" (1/1) ... [2022-07-19 10:50:17,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17" (1/1) ... [2022-07-19 10:50:17,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17" (1/1) ... [2022-07-19 10:50:17,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17" (1/1) ... [2022-07-19 10:50:17,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17" (1/1) ... [2022-07-19 10:50:17,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17" (1/1) ... [2022-07-19 10:50:17,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17" (1/1) ... [2022-07-19 10:50:17,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:50:17,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:50:17,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:50:17,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:50:17,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17" (1/1) ... [2022-07-19 10:50:17,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:50:17,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:50:17,463 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-19 10:50:17,468 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-19 10:50:17,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:50:17,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:50:17,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:50:17,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:50:17,563 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:50:17,564 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:50:17,579 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:50:18,060 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-07-19 10:50:18,061 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-07-19 10:50:18,061 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:50:18,067 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:50:18,068 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 10:50:18,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:50:18 BoogieIcfgContainer [2022-07-19 10:50:18,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:50:18,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:50:18,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:50:18,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:50:18,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:50:17" (1/3) ... [2022-07-19 10:50:18,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e86c672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:50:18, skipping insertion in model container [2022-07-19 10:50:18,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:17" (2/3) ... [2022-07-19 10:50:18,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e86c672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:50:18, skipping insertion in model container [2022-07-19 10:50:18,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:50:18" (3/3) ... [2022-07-19 10:50:18,106 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2022-07-19 10:50:18,140 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:50:18,140 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:50:18,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:50:18,204 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@129f65b9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14c9571f [2022-07-19 10:50:18,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:50:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 132 states have (on average 1.75) internal successors, (231), 133 states have internal predecessors, (231), 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-19 10:50:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 10:50:18,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:18,215 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, 1] [2022-07-19 10:50:18,216 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:18,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 260039818, now seen corresponding path program 1 times [2022-07-19 10:50:18,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:18,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758491774] [2022-07-19 10:50:18,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:18,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:18,421 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-19 10:50:18,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:18,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758491774] [2022-07-19 10:50:18,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758491774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:18,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:18,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43827649] [2022-07-19 10:50:18,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:18,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:18,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:18,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:18,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:18,462 INFO L87 Difference]: Start difference. First operand has 134 states, 132 states have (on average 1.75) internal successors, (231), 133 states have internal predecessors, (231), 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.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-19 10:50:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:18,655 INFO L93 Difference]: Finished difference Result 263 states and 455 transitions. [2022-07-19 10:50:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:18,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-07-19 10:50:18,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:18,668 INFO L225 Difference]: With dead ends: 263 [2022-07-19 10:50:18,669 INFO L226 Difference]: Without dead ends: 121 [2022-07-19 10:50:18,672 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-19 10:50:18,676 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 8 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:18,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 338 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-19 10:50:18,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-19 10:50:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5583333333333333) internal successors, (187), 120 states have internal predecessors, (187), 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-19 10:50:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2022-07-19 10:50:18,721 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 25 [2022-07-19 10:50:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:18,722 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2022-07-19 10:50:18,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-19 10:50:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2022-07-19 10:50:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 10:50:18,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:18,727 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-19 10:50:18,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:50:18,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:18,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:18,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1631610026, now seen corresponding path program 1 times [2022-07-19 10:50:18,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:18,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108608629] [2022-07-19 10:50:18,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:18,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:18,827 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-19 10:50:18,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:18,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108608629] [2022-07-19 10:50:18,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108608629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:18,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:18,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024077910] [2022-07-19 10:50:18,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:18,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:18,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:18,830 INFO L87 Difference]: Start difference. First operand 121 states and 187 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-19 10:50:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:18,967 INFO L93 Difference]: Finished difference Result 249 states and 388 transitions. [2022-07-19 10:50:18,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:18,968 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-19 10:50:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:18,969 INFO L225 Difference]: With dead ends: 249 [2022-07-19 10:50:18,969 INFO L226 Difference]: Without dead ends: 139 [2022-07-19 10:50:18,970 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-19 10:50:18,972 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:18,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 259 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-19 10:50:18,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2022-07-19 10:50:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.5333333333333334) internal successors, (207), 135 states have internal predecessors, (207), 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-19 10:50:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2022-07-19 10:50:18,982 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 207 transitions. Word has length 37 [2022-07-19 10:50:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:18,983 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 207 transitions. [2022-07-19 10:50:18,983 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-19 10:50:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 207 transitions. [2022-07-19 10:50:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 10:50:18,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:18,985 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-19 10:50:18,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:50:18,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1554238703, now seen corresponding path program 1 times [2022-07-19 10:50:18,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:18,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942253852] [2022-07-19 10:50:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:18,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:19,042 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-19 10:50:19,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:19,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942253852] [2022-07-19 10:50:19,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942253852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:19,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:19,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:19,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232085724] [2022-07-19 10:50:19,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:19,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:19,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:19,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:19,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:19,050 INFO L87 Difference]: Start difference. First operand 136 states and 207 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-19 10:50:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:19,070 INFO L93 Difference]: Finished difference Result 287 states and 432 transitions. [2022-07-19 10:50:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:19,071 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-19 10:50:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:19,074 INFO L225 Difference]: With dead ends: 287 [2022-07-19 10:50:19,074 INFO L226 Difference]: Without dead ends: 162 [2022-07-19 10:50:19,075 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-19 10:50:19,076 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 21 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 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-19 10:50:19,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 343 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-19 10:50:19,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-19 10:50:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 240 transitions. [2022-07-19 10:50:19,087 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 240 transitions. Word has length 51 [2022-07-19 10:50:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:19,088 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 240 transitions. [2022-07-19 10:50:19,088 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-19 10:50:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2022-07-19 10:50:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 10:50:19,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:19,090 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-19 10:50:19,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:50:19,090 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:19,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:19,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1420225197, now seen corresponding path program 1 times [2022-07-19 10:50:19,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:19,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956112911] [2022-07-19 10:50:19,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:19,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:19,138 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-19 10:50:19,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:19,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956112911] [2022-07-19 10:50:19,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956112911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:19,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:19,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:19,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511885267] [2022-07-19 10:50:19,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:19,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:19,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:19,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:19,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:19,142 INFO L87 Difference]: Start difference. First operand 162 states and 240 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-19 10:50:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:19,272 INFO L93 Difference]: Finished difference Result 308 states and 467 transitions. [2022-07-19 10:50:19,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:19,272 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-19 10:50:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:19,275 INFO L225 Difference]: With dead ends: 308 [2022-07-19 10:50:19,275 INFO L226 Difference]: Without dead ends: 183 [2022-07-19 10:50:19,277 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-19 10:50:19,279 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 16 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:19,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 272 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:19,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-19 10:50:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2022-07-19 10:50:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.4719101123595506) internal successors, (262), 178 states have internal predecessors, (262), 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-19 10:50:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 262 transitions. [2022-07-19 10:50:19,294 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 262 transitions. Word has length 51 [2022-07-19 10:50:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:19,295 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 262 transitions. [2022-07-19 10:50:19,295 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-19 10:50:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 262 transitions. [2022-07-19 10:50:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-19 10:50:19,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:19,297 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, 1] [2022-07-19 10:50:19,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:50:19,297 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:19,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2017552045, now seen corresponding path program 1 times [2022-07-19 10:50:19,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:19,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802612412] [2022-07-19 10:50:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:19,394 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-19 10:50:19,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:19,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802612412] [2022-07-19 10:50:19,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802612412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:19,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:19,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858406235] [2022-07-19 10:50:19,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:19,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:19,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:19,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:19,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:19,400 INFO L87 Difference]: Start difference. First operand 179 states and 262 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-19 10:50:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:19,547 INFO L93 Difference]: Finished difference Result 363 states and 553 transitions. [2022-07-19 10:50:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:19,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 69 [2022-07-19 10:50:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:19,549 INFO L225 Difference]: With dead ends: 363 [2022-07-19 10:50:19,549 INFO L226 Difference]: Without dead ends: 179 [2022-07-19 10:50:19,550 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-19 10:50:19,551 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 27 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:19,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 253 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-19 10:50:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-07-19 10:50:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.4606741573033708) internal successors, (260), 178 states have internal predecessors, (260), 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-19 10:50:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 260 transitions. [2022-07-19 10:50:19,560 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 260 transitions. Word has length 69 [2022-07-19 10:50:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:19,560 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 260 transitions. [2022-07-19 10:50:19,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-19 10:50:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 260 transitions. [2022-07-19 10:50:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-19 10:50:19,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:19,562 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, 1, 1] [2022-07-19 10:50:19,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:50:19,563 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:19,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1856789330, now seen corresponding path program 1 times [2022-07-19 10:50:19,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:19,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099249757] [2022-07-19 10:50:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:19,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:19,614 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-19 10:50:19,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:19,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099249757] [2022-07-19 10:50:19,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099249757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:19,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:19,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:19,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848184737] [2022-07-19 10:50:19,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:19,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:19,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:19,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:19,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:19,618 INFO L87 Difference]: Start difference. First operand 179 states and 260 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-19 10:50:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:19,641 INFO L93 Difference]: Finished difference Result 492 states and 718 transitions. [2022-07-19 10:50:19,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:19,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 70 [2022-07-19 10:50:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:19,644 INFO L225 Difference]: With dead ends: 492 [2022-07-19 10:50:19,644 INFO L226 Difference]: Without dead ends: 350 [2022-07-19 10:50:19,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-19 10:50:19,645 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 137 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:19,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 350 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-07-19 10:50:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2022-07-19 10:50:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.4524495677233429) internal successors, (504), 347 states have internal predecessors, (504), 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-19 10:50:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 504 transitions. [2022-07-19 10:50:19,661 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 504 transitions. Word has length 70 [2022-07-19 10:50:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:19,661 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 504 transitions. [2022-07-19 10:50:19,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-19 10:50:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 504 transitions. [2022-07-19 10:50:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-19 10:50:19,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:19,663 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, 1, 1] [2022-07-19 10:50:19,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:50:19,664 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1069339995, now seen corresponding path program 1 times [2022-07-19 10:50:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:19,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253544432] [2022-07-19 10:50:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:19,701 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-19 10:50:19,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:19,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253544432] [2022-07-19 10:50:19,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253544432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:19,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:19,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:19,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132369740] [2022-07-19 10:50:19,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:19,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:19,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:19,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:19,704 INFO L87 Difference]: Start difference. First operand 348 states and 504 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-19 10:50:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:19,724 INFO L93 Difference]: Finished difference Result 759 states and 1111 transitions. [2022-07-19 10:50:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:19,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 70 [2022-07-19 10:50:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:19,727 INFO L225 Difference]: With dead ends: 759 [2022-07-19 10:50:19,727 INFO L226 Difference]: Without dead ends: 477 [2022-07-19 10:50:19,728 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-19 10:50:19,729 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 131 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:19,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 344 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:19,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-07-19 10:50:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2022-07-19 10:50:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 1.4451476793248945) internal successors, (685), 474 states have internal predecessors, (685), 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-19 10:50:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 685 transitions. [2022-07-19 10:50:19,743 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 685 transitions. Word has length 70 [2022-07-19 10:50:19,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:19,743 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 685 transitions. [2022-07-19 10:50:19,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-19 10:50:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 685 transitions. [2022-07-19 10:50:19,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-19 10:50:19,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:19,745 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, 1, 1] [2022-07-19 10:50:19,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:50:19,746 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:19,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:19,746 INFO L85 PathProgramCache]: Analyzing trace with hash 751998128, now seen corresponding path program 1 times [2022-07-19 10:50:19,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:19,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849013246] [2022-07-19 10:50:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:19,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:19,792 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-19 10:50:19,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:19,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849013246] [2022-07-19 10:50:19,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849013246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:19,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:19,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:19,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916134285] [2022-07-19 10:50:19,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:19,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:19,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:19,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:19,795 INFO L87 Difference]: Start difference. First operand 475 states and 685 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-19 10:50:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:19,812 INFO L93 Difference]: Finished difference Result 479 states and 687 transitions. [2022-07-19 10:50:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:19,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 70 [2022-07-19 10:50:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:19,816 INFO L225 Difference]: With dead ends: 479 [2022-07-19 10:50:19,817 INFO L226 Difference]: Without dead ends: 341 [2022-07-19 10:50:19,817 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-19 10:50:19,818 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 129 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:19,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 387 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-19 10:50:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2022-07-19 10:50:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.4260355029585798) internal successors, (482), 338 states have internal predecessors, (482), 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-19 10:50:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 482 transitions. [2022-07-19 10:50:19,833 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 482 transitions. Word has length 70 [2022-07-19 10:50:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:19,835 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 482 transitions. [2022-07-19 10:50:19,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-19 10:50:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 482 transitions. [2022-07-19 10:50:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-19 10:50:19,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:19,841 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, 1, 1] [2022-07-19 10:50:19,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:50:19,842 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1539447463, now seen corresponding path program 1 times [2022-07-19 10:50:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:19,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294378398] [2022-07-19 10:50:19,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:19,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:19,890 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-19 10:50:19,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:19,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294378398] [2022-07-19 10:50:19,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294378398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:19,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:19,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:19,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023110696] [2022-07-19 10:50:19,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:19,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:19,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:19,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:19,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:19,893 INFO L87 Difference]: Start difference. First operand 339 states and 482 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-19 10:50:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:19,909 INFO L93 Difference]: Finished difference Result 478 states and 682 transitions. [2022-07-19 10:50:19,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:19,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 70 [2022-07-19 10:50:19,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:19,912 INFO L225 Difference]: With dead ends: 478 [2022-07-19 10:50:19,912 INFO L226 Difference]: Without dead ends: 341 [2022-07-19 10:50:19,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-19 10:50:19,916 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 125 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:19,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 487 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-19 10:50:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2022-07-19 10:50:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.4201183431952662) internal successors, (480), 338 states have internal predecessors, (480), 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-19 10:50:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 480 transitions. [2022-07-19 10:50:19,926 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 480 transitions. Word has length 70 [2022-07-19 10:50:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:19,926 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 480 transitions. [2022-07-19 10:50:19,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-19 10:50:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 480 transitions. [2022-07-19 10:50:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 10:50:19,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:19,928 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, 1, 1, 1, 1] [2022-07-19 10:50:19,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 10:50:19,928 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:19,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1979994253, now seen corresponding path program 1 times [2022-07-19 10:50:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:19,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190673242] [2022-07-19 10:50:19,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:19,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:19,962 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-19 10:50:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:19,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190673242] [2022-07-19 10:50:19,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190673242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:19,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:19,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:19,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985622511] [2022-07-19 10:50:19,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:19,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:19,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:19,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:19,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:19,964 INFO L87 Difference]: Start difference. First operand 339 states and 480 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-19 10:50:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:19,994 INFO L93 Difference]: Finished difference Result 881 states and 1267 transitions. [2022-07-19 10:50:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:19,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 72 [2022-07-19 10:50:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:19,997 INFO L225 Difference]: With dead ends: 881 [2022-07-19 10:50:19,997 INFO L226 Difference]: Without dead ends: 608 [2022-07-19 10:50:19,998 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-19 10:50:19,998 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 130 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 379 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-19 10:50:19,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 379 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-19 10:50:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2022-07-19 10:50:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 1.4168039538714992) internal successors, (860), 607 states have internal predecessors, (860), 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-19 10:50:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 860 transitions. [2022-07-19 10:50:20,014 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 860 transitions. Word has length 72 [2022-07-19 10:50:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:20,015 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 860 transitions. [2022-07-19 10:50:20,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-19 10:50:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 860 transitions. [2022-07-19 10:50:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-19 10:50:20,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:20,017 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, 1, 1, 1, 1, 1] [2022-07-19 10:50:20,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:50:20,017 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:20,018 INFO L85 PathProgramCache]: Analyzing trace with hash -663990389, now seen corresponding path program 1 times [2022-07-19 10:50:20,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:20,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328813254] [2022-07-19 10:50:20,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:20,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 10:50:20,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:20,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328813254] [2022-07-19 10:50:20,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328813254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:20,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:20,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:20,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459185409] [2022-07-19 10:50:20,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:20,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:20,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:20,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:20,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:20,052 INFO L87 Difference]: Start difference. First operand 608 states and 860 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:20,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:20,078 INFO L93 Difference]: Finished difference Result 1192 states and 1691 transitions. [2022-07-19 10:50:20,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:20,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-07-19 10:50:20,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:20,082 INFO L225 Difference]: With dead ends: 1192 [2022-07-19 10:50:20,084 INFO L226 Difference]: Without dead ends: 650 [2022-07-19 10:50:20,085 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-19 10:50:20,086 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 361 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-19 10:50:20,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 361 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-07-19 10:50:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-07-19 10:50:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 1.4083204930662558) internal successors, (914), 649 states have internal predecessors, (914), 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-19 10:50:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 914 transitions. [2022-07-19 10:50:20,102 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 914 transitions. Word has length 73 [2022-07-19 10:50:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:20,104 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 914 transitions. [2022-07-19 10:50:20,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 914 transitions. [2022-07-19 10:50:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-19 10:50:20,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:20,106 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, 1, 1, 1, 1, 1] [2022-07-19 10:50:20,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:50:20,106 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:20,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:20,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1666060429, now seen corresponding path program 1 times [2022-07-19 10:50:20,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:20,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20999605] [2022-07-19 10:50:20,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:20,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:20,148 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-19 10:50:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:20,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20999605] [2022-07-19 10:50:20,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20999605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:20,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:20,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042401046] [2022-07-19 10:50:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:20,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:20,150 INFO L87 Difference]: Start difference. First operand 650 states and 914 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-19 10:50:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:20,255 INFO L93 Difference]: Finished difference Result 1330 states and 1909 transitions. [2022-07-19 10:50:20,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:20,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 90 [2022-07-19 10:50:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:20,259 INFO L225 Difference]: With dead ends: 1330 [2022-07-19 10:50:20,259 INFO L226 Difference]: Without dead ends: 746 [2022-07-19 10:50:20,260 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-19 10:50:20,260 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:20,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 271 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-07-19 10:50:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 734. [2022-07-19 10:50:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.38881309686221) internal successors, (1018), 733 states have internal predecessors, (1018), 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-19 10:50:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1018 transitions. [2022-07-19 10:50:20,278 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1018 transitions. Word has length 90 [2022-07-19 10:50:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:20,279 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1018 transitions. [2022-07-19 10:50:20,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-19 10:50:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1018 transitions. [2022-07-19 10:50:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-19 10:50:20,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:20,281 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, 1, 1, 1] [2022-07-19 10:50:20,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:50:20,281 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash -809022581, now seen corresponding path program 1 times [2022-07-19 10:50:20,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:20,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790082968] [2022-07-19 10:50:20,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:20,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:20,315 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-19 10:50:20,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:20,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790082968] [2022-07-19 10:50:20,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790082968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:20,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:20,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:20,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084865097] [2022-07-19 10:50:20,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:20,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:20,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:20,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:20,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:20,317 INFO L87 Difference]: Start difference. First operand 734 states and 1018 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-19 10:50:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:20,352 INFO L93 Difference]: Finished difference Result 1049 states and 1465 transitions. [2022-07-19 10:50:20,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:20,352 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 110 [2022-07-19 10:50:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:20,356 INFO L225 Difference]: With dead ends: 1049 [2022-07-19 10:50:20,356 INFO L226 Difference]: Without dead ends: 1047 [2022-07-19 10:50:20,357 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-19 10:50:20,357 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 148 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 321 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-19 10:50:20,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 321 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:20,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2022-07-19 10:50:20,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2022-07-19 10:50:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1046 states have (on average 1.3977055449330784) internal successors, (1462), 1046 states have internal predecessors, (1462), 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-19 10:50:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1462 transitions. [2022-07-19 10:50:20,385 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1462 transitions. Word has length 110 [2022-07-19 10:50:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:20,385 INFO L495 AbstractCegarLoop]: Abstraction has 1047 states and 1462 transitions. [2022-07-19 10:50:20,385 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-19 10:50:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1462 transitions. [2022-07-19 10:50:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-19 10:50:20,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:20,388 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:50:20,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:50:20,388 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:20,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:20,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2021159997, now seen corresponding path program 1 times [2022-07-19 10:50:20,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:20,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709795253] [2022-07-19 10:50:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:20,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-19 10:50:20,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:20,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709795253] [2022-07-19 10:50:20,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709795253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:20,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:20,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:20,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087105662] [2022-07-19 10:50:20,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:20,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:20,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:20,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:20,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:20,438 INFO L87 Difference]: Start difference. First operand 1047 states and 1462 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-19 10:50:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:20,597 INFO L93 Difference]: Finished difference Result 2322 states and 3361 transitions. [2022-07-19 10:50:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:20,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 132 [2022-07-19 10:50:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:20,602 INFO L225 Difference]: With dead ends: 2322 [2022-07-19 10:50:20,602 INFO L226 Difference]: Without dead ends: 1335 [2022-07-19 10:50:20,604 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-19 10:50:20,604 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 75 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:20,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 246 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-07-19 10:50:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1287. [2022-07-19 10:50:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1286 states have (on average 1.4401244167962675) internal successors, (1852), 1286 states have internal predecessors, (1852), 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-19 10:50:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1852 transitions. [2022-07-19 10:50:20,637 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1852 transitions. Word has length 132 [2022-07-19 10:50:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:20,637 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1852 transitions. [2022-07-19 10:50:20,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-19 10:50:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1852 transitions. [2022-07-19 10:50:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-19 10:50:20,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:20,640 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 10:50:20,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:50:20,641 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash 505572298, now seen corresponding path program 1 times [2022-07-19 10:50:20,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:20,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231592653] [2022-07-19 10:50:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:20,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-19 10:50:20,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:20,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231592653] [2022-07-19 10:50:20,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231592653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:20,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:20,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:20,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055080807] [2022-07-19 10:50:20,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:20,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:20,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:20,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:20,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:20,677 INFO L87 Difference]: Start difference. First operand 1287 states and 1852 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-19 10:50:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:20,839 INFO L93 Difference]: Finished difference Result 3062 states and 4552 transitions. [2022-07-19 10:50:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:20,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 158 [2022-07-19 10:50:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:20,846 INFO L225 Difference]: With dead ends: 3062 [2022-07-19 10:50:20,847 INFO L226 Difference]: Without dead ends: 1739 [2022-07-19 10:50:20,849 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-19 10:50:20,867 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 81 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:20,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 225 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-07-19 10:50:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1665. [2022-07-19 10:50:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1664 states have (on average 1.4158653846153846) internal successors, (2356), 1664 states have internal predecessors, (2356), 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-19 10:50:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2356 transitions. [2022-07-19 10:50:20,916 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2356 transitions. Word has length 158 [2022-07-19 10:50:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:20,917 INFO L495 AbstractCegarLoop]: Abstraction has 1665 states and 2356 transitions. [2022-07-19 10:50:20,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-19 10:50:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2356 transitions. [2022-07-19 10:50:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-19 10:50:20,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:20,921 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:50:20,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 10:50:20,922 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:20,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:20,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1615904047, now seen corresponding path program 1 times [2022-07-19 10:50:20,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:20,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703987866] [2022-07-19 10:50:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:20,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-07-19 10:50:20,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:20,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703987866] [2022-07-19 10:50:20,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703987866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:20,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:20,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804880640] [2022-07-19 10:50:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:20,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:20,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:20,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:20,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:20,964 INFO L87 Difference]: Start difference. First operand 1665 states and 2356 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-19 10:50:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:21,131 INFO L93 Difference]: Finished difference Result 3576 states and 5107 transitions. [2022-07-19 10:50:21,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:21,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 179 [2022-07-19 10:50:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:21,138 INFO L225 Difference]: With dead ends: 3576 [2022-07-19 10:50:21,138 INFO L226 Difference]: Without dead ends: 1887 [2022-07-19 10:50:21,141 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-19 10:50:21,141 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 84 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:21,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 221 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2022-07-19 10:50:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1815. [2022-07-19 10:50:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1814 states have (on average 1.4046306504961412) internal successors, (2548), 1814 states have internal predecessors, (2548), 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-19 10:50:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2548 transitions. [2022-07-19 10:50:21,189 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2548 transitions. Word has length 179 [2022-07-19 10:50:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:21,190 INFO L495 AbstractCegarLoop]: Abstraction has 1815 states and 2548 transitions. [2022-07-19 10:50:21,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-19 10:50:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2548 transitions. [2022-07-19 10:50:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-19 10:50:21,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:21,194 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:50:21,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 10:50:21,195 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:21,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:21,195 INFO L85 PathProgramCache]: Analyzing trace with hash -68206532, now seen corresponding path program 1 times [2022-07-19 10:50:21,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:21,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462028746] [2022-07-19 10:50:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:21,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-19 10:50:21,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:21,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462028746] [2022-07-19 10:50:21,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462028746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:21,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:21,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:21,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748801997] [2022-07-19 10:50:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:21,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:21,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:21,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:21,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:21,250 INFO L87 Difference]: Start difference. First operand 1815 states and 2548 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-19 10:50:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:21,401 INFO L93 Difference]: Finished difference Result 3876 states and 5485 transitions. [2022-07-19 10:50:21,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:21,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 203 [2022-07-19 10:50:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:21,409 INFO L225 Difference]: With dead ends: 3876 [2022-07-19 10:50:21,409 INFO L226 Difference]: Without dead ends: 2049 [2022-07-19 10:50:21,411 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-19 10:50:21,412 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 85 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:21,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 219 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2022-07-19 10:50:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1983. [2022-07-19 10:50:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1983 states, 1982 states have (on average 1.3975782038345106) internal successors, (2770), 1982 states have internal predecessors, (2770), 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-19 10:50:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2770 transitions. [2022-07-19 10:50:21,463 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2770 transitions. Word has length 203 [2022-07-19 10:50:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:21,463 INFO L495 AbstractCegarLoop]: Abstraction has 1983 states and 2770 transitions. [2022-07-19 10:50:21,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-19 10:50:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2770 transitions. [2022-07-19 10:50:21,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-19 10:50:21,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:21,468 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:50:21,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:50:21,468 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:21,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:21,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1035557186, now seen corresponding path program 1 times [2022-07-19 10:50:21,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:21,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579038582] [2022-07-19 10:50:21,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:21,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-19 10:50:21,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:21,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579038582] [2022-07-19 10:50:21,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579038582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:21,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:21,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724526539] [2022-07-19 10:50:21,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:21,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:21,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:21,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:21,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:21,511 INFO L87 Difference]: Start difference. First operand 1983 states and 2770 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-19 10:50:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:21,685 INFO L93 Difference]: Finished difference Result 4212 states and 5935 transitions. [2022-07-19 10:50:21,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:21,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 203 [2022-07-19 10:50:21,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:21,693 INFO L225 Difference]: With dead ends: 4212 [2022-07-19 10:50:21,694 INFO L226 Difference]: Without dead ends: 2241 [2022-07-19 10:50:21,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-19 10:50:21,696 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 87 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:21,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 217 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2022-07-19 10:50:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2169. [2022-07-19 10:50:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.3994464944649447) internal successors, (3034), 2168 states have internal predecessors, (3034), 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-19 10:50:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3034 transitions. [2022-07-19 10:50:21,755 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3034 transitions. Word has length 203 [2022-07-19 10:50:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:21,755 INFO L495 AbstractCegarLoop]: Abstraction has 2169 states and 3034 transitions. [2022-07-19 10:50:21,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-19 10:50:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3034 transitions. [2022-07-19 10:50:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-07-19 10:50:21,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:21,760 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:50:21,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 10:50:21,761 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:21,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:21,761 INFO L85 PathProgramCache]: Analyzing trace with hash 454348542, now seen corresponding path program 1 times [2022-07-19 10:50:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:21,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466647757] [2022-07-19 10:50:21,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:21,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-07-19 10:50:21,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:21,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466647757] [2022-07-19 10:50:21,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466647757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:21,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:21,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:21,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987201529] [2022-07-19 10:50:21,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:21,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:21,810 INFO L87 Difference]: Start difference. First operand 2169 states and 3034 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-19 10:50:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:21,971 INFO L93 Difference]: Finished difference Result 4578 states and 6451 transitions. [2022-07-19 10:50:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:21,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 233 [2022-07-19 10:50:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:21,980 INFO L225 Difference]: With dead ends: 4578 [2022-07-19 10:50:21,981 INFO L226 Difference]: Without dead ends: 2445 [2022-07-19 10:50:21,983 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-19 10:50:21,984 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 90 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:21,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 211 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2022-07-19 10:50:22,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2379. [2022-07-19 10:50:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2378 states have (on average 1.4070647603027755) internal successors, (3346), 2378 states have internal predecessors, (3346), 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-19 10:50:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3346 transitions. [2022-07-19 10:50:22,060 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3346 transitions. Word has length 233 [2022-07-19 10:50:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:22,060 INFO L495 AbstractCegarLoop]: Abstraction has 2379 states and 3346 transitions. [2022-07-19 10:50:22,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-19 10:50:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3346 transitions. [2022-07-19 10:50:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-19 10:50:22,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:22,065 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:50:22,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 10:50:22,066 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2054712224, now seen corresponding path program 1 times [2022-07-19 10:50:22,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:22,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872717624] [2022-07-19 10:50:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:22,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2022-07-19 10:50:22,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:22,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872717624] [2022-07-19 10:50:22,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872717624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:22,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:22,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:22,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814673363] [2022-07-19 10:50:22,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:22,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:22,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:22,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:22,121 INFO L87 Difference]: Start difference. First operand 2379 states and 3346 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-19 10:50:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:22,280 INFO L93 Difference]: Finished difference Result 4758 states and 6685 transitions. [2022-07-19 10:50:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:22,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 268 [2022-07-19 10:50:22,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:22,289 INFO L225 Difference]: With dead ends: 4758 [2022-07-19 10:50:22,289 INFO L226 Difference]: Without dead ends: 2427 [2022-07-19 10:50:22,292 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-19 10:50:22,293 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 93 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:22,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 206 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2022-07-19 10:50:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2361. [2022-07-19 10:50:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2360 states have (on average 1.3949152542372882) internal successors, (3292), 2360 states have internal predecessors, (3292), 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-19 10:50:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3292 transitions. [2022-07-19 10:50:22,394 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3292 transitions. Word has length 268 [2022-07-19 10:50:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:22,394 INFO L495 AbstractCegarLoop]: Abstraction has 2361 states and 3292 transitions. [2022-07-19 10:50:22,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-19 10:50:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3292 transitions. [2022-07-19 10:50:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-07-19 10:50:22,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:22,401 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:50:22,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 10:50:22,401 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:22,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:22,402 INFO L85 PathProgramCache]: Analyzing trace with hash -671382342, now seen corresponding path program 1 times [2022-07-19 10:50:22,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:22,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439113989] [2022-07-19 10:50:22,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:22,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-07-19 10:50:22,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:22,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439113989] [2022-07-19 10:50:22,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439113989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:22,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:22,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962492491] [2022-07-19 10:50:22,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:22,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:22,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:22,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:22,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:22,470 INFO L87 Difference]: Start difference. First operand 2361 states and 3292 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-19 10:50:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:22,620 INFO L93 Difference]: Finished difference Result 4710 states and 6565 transitions. [2022-07-19 10:50:22,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:22,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 278 [2022-07-19 10:50:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:22,629 INFO L225 Difference]: With dead ends: 4710 [2022-07-19 10:50:22,629 INFO L226 Difference]: Without dead ends: 2415 [2022-07-19 10:50:22,632 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-19 10:50:22,632 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 48 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:22,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 265 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2022-07-19 10:50:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2361. [2022-07-19 10:50:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2360 states have (on average 1.3720338983050848) internal successors, (3238), 2360 states have internal predecessors, (3238), 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-19 10:50:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3238 transitions. [2022-07-19 10:50:22,702 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3238 transitions. Word has length 278 [2022-07-19 10:50:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:22,703 INFO L495 AbstractCegarLoop]: Abstraction has 2361 states and 3238 transitions. [2022-07-19 10:50:22,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-19 10:50:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3238 transitions. [2022-07-19 10:50:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-07-19 10:50:22,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:22,709 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:50:22,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 10:50:22,710 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:22,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:22,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1156408394, now seen corresponding path program 1 times [2022-07-19 10:50:22,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:22,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34609375] [2022-07-19 10:50:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:22,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-07-19 10:50:22,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:22,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34609375] [2022-07-19 10:50:22,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34609375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:22,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:22,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:22,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981561711] [2022-07-19 10:50:22,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:22,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:22,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:22,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:22,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:22,782 INFO L87 Difference]: Start difference. First operand 2361 states and 3238 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-19 10:50:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:22,938 INFO L93 Difference]: Finished difference Result 4953 states and 6742 transitions. [2022-07-19 10:50:22,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:22,939 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 305 [2022-07-19 10:50:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:22,948 INFO L225 Difference]: With dead ends: 4953 [2022-07-19 10:50:22,948 INFO L226 Difference]: Without dead ends: 2658 [2022-07-19 10:50:22,951 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-19 10:50:22,952 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 106 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:22,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 201 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-07-19 10:50:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2448. [2022-07-19 10:50:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 2447 states have (on average 1.3710666121781774) internal successors, (3355), 2447 states have internal predecessors, (3355), 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-19 10:50:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3355 transitions. [2022-07-19 10:50:23,035 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3355 transitions. Word has length 305 [2022-07-19 10:50:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:23,036 INFO L495 AbstractCegarLoop]: Abstraction has 2448 states and 3355 transitions. [2022-07-19 10:50:23,036 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-19 10:50:23,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3355 transitions. [2022-07-19 10:50:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2022-07-19 10:50:23,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:23,042 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 10:50:23,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 10:50:23,042 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:23,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:23,043 INFO L85 PathProgramCache]: Analyzing trace with hash 619350975, now seen corresponding path program 1 times [2022-07-19 10:50:23,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:23,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574818586] [2022-07-19 10:50:23,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:23,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-07-19 10:50:23,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:23,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574818586] [2022-07-19 10:50:23,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574818586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:23,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:23,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:23,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593577891] [2022-07-19 10:50:23,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:23,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:23,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:23,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:23,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:23,117 INFO L87 Difference]: Start difference. First operand 2448 states and 3355 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-19 10:50:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:23,263 INFO L93 Difference]: Finished difference Result 4992 states and 6787 transitions. [2022-07-19 10:50:23,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:23,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 306 [2022-07-19 10:50:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:23,280 INFO L225 Difference]: With dead ends: 4992 [2022-07-19 10:50:23,280 INFO L226 Difference]: Without dead ends: 2349 [2022-07-19 10:50:23,283 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-19 10:50:23,283 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:23,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 273 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-07-19 10:50:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2343. [2022-07-19 10:50:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.365926558497011) internal successors, (3199), 2342 states have internal predecessors, (3199), 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-19 10:50:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3199 transitions. [2022-07-19 10:50:23,357 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3199 transitions. Word has length 306 [2022-07-19 10:50:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:23,358 INFO L495 AbstractCegarLoop]: Abstraction has 2343 states and 3199 transitions. [2022-07-19 10:50:23,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-19 10:50:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3199 transitions. [2022-07-19 10:50:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2022-07-19 10:50:23,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:23,364 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:50:23,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 10:50:23,364 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:23,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1977728998, now seen corresponding path program 1 times [2022-07-19 10:50:23,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:23,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671061356] [2022-07-19 10:50:23,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:23,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 476 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-07-19 10:50:23,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:23,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671061356] [2022-07-19 10:50:23,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671061356] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:50:23,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465836257] [2022-07-19 10:50:23,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:23,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:23,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:50:23,435 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-19 10:50:23,448 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-19 10:50:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:23,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 10:50:23,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:50:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 384 proven. 12 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2022-07-19 10:50:23,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:50:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 384 proven. 12 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2022-07-19 10:50:23,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465836257] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:50:23,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:50:23,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-19 10:50:23,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664530830] [2022-07-19 10:50:23,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:50:23,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:50:23,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:23,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:50:23,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:50:23,825 INFO L87 Difference]: Start difference. First operand 2343 states and 3199 transitions. Second operand has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 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-19 10:50:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:24,333 INFO L93 Difference]: Finished difference Result 5675 states and 7940 transitions. [2022-07-19 10:50:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:50:24,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2022-07-19 10:50:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:24,342 INFO L225 Difference]: With dead ends: 5675 [2022-07-19 10:50:24,343 INFO L226 Difference]: Without dead ends: 3314 [2022-07-19 10:50:24,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 635 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:50:24,348 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 716 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:24,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 833 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:50:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2022-07-19 10:50:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2631. [2022-07-19 10:50:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2630 states have (on average 1.373384030418251) internal successors, (3612), 2630 states have internal predecessors, (3612), 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-19 10:50:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3612 transitions. [2022-07-19 10:50:24,422 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3612 transitions. Word has length 316 [2022-07-19 10:50:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:24,422 INFO L495 AbstractCegarLoop]: Abstraction has 2631 states and 3612 transitions. [2022-07-19 10:50:24,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 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-19 10:50:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3612 transitions. [2022-07-19 10:50:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2022-07-19 10:50:24,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:24,428 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:50:24,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:50:24,653 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,SelfDestructingSolverStorable23 [2022-07-19 10:50:24,653 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:24,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash -761229711, now seen corresponding path program 1 times [2022-07-19 10:50:24,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:24,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773333412] [2022-07-19 10:50:24,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:24,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 476 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-07-19 10:50:24,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:24,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773333412] [2022-07-19 10:50:24,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773333412] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:50:24,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676237674] [2022-07-19 10:50:24,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:24,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:24,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:50:24,741 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-19 10:50:24,770 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-19 10:50:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:24,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 10:50:24,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:50:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2022-07-19 10:50:25,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:50:25,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676237674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:25,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:50:25,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2022-07-19 10:50:25,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325157549] [2022-07-19 10:50:25,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:25,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:50:25,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:25,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:50:25,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:50:25,027 INFO L87 Difference]: Start difference. First operand 2631 states and 3612 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-19 10:50:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:25,232 INFO L93 Difference]: Finished difference Result 3853 states and 5281 transitions. [2022-07-19 10:50:25,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:50:25,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 317 [2022-07-19 10:50:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:25,237 INFO L225 Difference]: With dead ends: 3853 [2022-07-19 10:50:25,238 INFO L226 Difference]: Without dead ends: 2658 [2022-07-19 10:50:25,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:50:25,240 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 447 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:25,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 457 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-07-19 10:50:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2586. [2022-07-19 10:50:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2586 states, 2585 states have (on average 1.3705996131528047) internal successors, (3543), 2585 states have internal predecessors, (3543), 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-19 10:50:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3543 transitions. [2022-07-19 10:50:25,312 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3543 transitions. Word has length 317 [2022-07-19 10:50:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:25,312 INFO L495 AbstractCegarLoop]: Abstraction has 2586 states and 3543 transitions. [2022-07-19 10:50:25,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-19 10:50:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3543 transitions. [2022-07-19 10:50:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-07-19 10:50:25,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:25,319 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:50:25,347 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-19 10:50:25,531 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,SelfDestructingSolverStorable24 [2022-07-19 10:50:25,531 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:25,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2066727537, now seen corresponding path program 1 times [2022-07-19 10:50:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:25,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597750719] [2022-07-19 10:50:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:25,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 653 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-07-19 10:50:25,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:25,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597750719] [2022-07-19 10:50:25,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597750719] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:50:25,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157685175] [2022-07-19 10:50:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:25,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:25,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:50:25,610 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-19 10:50:25,612 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-19 10:50:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:25,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 10:50:25,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:50:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2022-07-19 10:50:25,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:50:25,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157685175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:25,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:50:25,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2022-07-19 10:50:25,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032631203] [2022-07-19 10:50:25,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:25,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:50:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:25,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:50:25,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:50:25,878 INFO L87 Difference]: Start difference. First operand 2586 states and 3543 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-19 10:50:26,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:26,073 INFO L93 Difference]: Finished difference Result 3606 states and 4893 transitions. [2022-07-19 10:50:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:50:26,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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 342 [2022-07-19 10:50:26,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:26,076 INFO L225 Difference]: With dead ends: 3606 [2022-07-19 10:50:26,076 INFO L226 Difference]: Without dead ends: 1187 [2022-07-19 10:50:26,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:50:26,079 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 420 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:26,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 532 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:26,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2022-07-19 10:50:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187. [2022-07-19 10:50:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1186 states have (on average 1.3625632377740304) internal successors, (1616), 1186 states have internal predecessors, (1616), 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-19 10:50:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1616 transitions. [2022-07-19 10:50:26,108 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1616 transitions. Word has length 342 [2022-07-19 10:50:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:26,109 INFO L495 AbstractCegarLoop]: Abstraction has 1187 states and 1616 transitions. [2022-07-19 10:50:26,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-19 10:50:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1616 transitions. [2022-07-19 10:50:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2022-07-19 10:50:26,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:26,114 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 10, 10, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:50:26,139 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-19 10:50:26,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:26,339 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:26,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:26,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1232901937, now seen corresponding path program 1 times [2022-07-19 10:50:26,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:26,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668908833] [2022-07-19 10:50:26,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:26,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 813 proven. 12 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2022-07-19 10:50:26,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:26,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668908833] [2022-07-19 10:50:26,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668908833] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:50:26,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926961060] [2022-07-19 10:50:26,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:26,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:26,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:50:26,414 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-19 10:50:26,416 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-19 10:50:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:26,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:50:26,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:50:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 813 proven. 12 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2022-07-19 10:50:26,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:50:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 813 proven. 12 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2022-07-19 10:50:26,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926961060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:50:26,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:50:26,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-19 10:50:26,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644161831] [2022-07-19 10:50:26,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:50:26,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:50:26,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:50:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:50:26,714 INFO L87 Difference]: Start difference. First operand 1187 states and 1616 transitions. Second operand has 8 states, 8 states have (on average 38.875) internal successors, (311), 8 states have internal predecessors, (311), 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-19 10:50:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:26,948 INFO L93 Difference]: Finished difference Result 1992 states and 2726 transitions. [2022-07-19 10:50:26,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:50:26,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.875) internal successors, (311), 8 states have internal predecessors, (311), 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 393 [2022-07-19 10:50:26,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:26,950 INFO L225 Difference]: With dead ends: 1992 [2022-07-19 10:50:26,950 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 10:50:26,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 784 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-19 10:50:26,952 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 107 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:26,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 484 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:50:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 10:50:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 10:50:26,953 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-19 10:50:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 10:50:26,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 393 [2022-07-19 10:50:26,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:26,954 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 10:50:26,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.875) internal successors, (311), 8 states have internal predecessors, (311), 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-19 10:50:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 10:50:26,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 10:50:26,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:50:26,984 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-19 10:50:27,180 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,SelfDestructingSolverStorable26 [2022-07-19 10:50:27,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 10:50:35,573 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 150 DAG size of output: 150 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 10:50:37,813 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2022-07-19 10:50:37,814 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 252) no Hoare annotation was computed. [2022-07-19 10:50:37,814 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 551) no Hoare annotation was computed. [2022-07-19 10:50:37,814 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 562) no Hoare annotation was computed. [2022-07-19 10:50:37,814 INFO L899 garLoopResultBuilder]: For program point L235-2(lines 213 545) no Hoare annotation was computed. [2022-07-19 10:50:37,818 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 573) no Hoare annotation was computed. [2022-07-19 10:50:37,818 INFO L895 garLoopResultBuilder]: At program point L203(lines 199 552) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (or (and (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352) (not .cse0) (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)))) [2022-07-19 10:50:37,818 INFO L895 garLoopResultBuilder]: At program point L137(lines 133 574) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|)) (.cse4 (not .cse7)) (.cse9 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (.cse0 (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4400)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse8 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse5 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse9 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse8 .cse5 .cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))))) [2022-07-19 10:50:37,819 INFO L899 garLoopResultBuilder]: For program point L501-1(lines 501 513) no Hoare annotation was computed. [2022-07-19 10:50:37,819 INFO L899 garLoopResultBuilder]: For program point L435(lines 435 439) no Hoare annotation was computed. [2022-07-19 10:50:37,819 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 242) no Hoare annotation was computed. [2022-07-19 10:50:37,819 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 550) no Hoare annotation was computed. [2022-07-19 10:50:37,819 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 561) no Hoare annotation was computed. [2022-07-19 10:50:37,819 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 572) no Hoare annotation was computed. [2022-07-19 10:50:37,820 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-07-19 10:50:37,820 INFO L895 garLoopResultBuilder]: At program point L206(lines 205 550) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse4 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse7 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse8 (not .cse0)) (.cse5 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 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|) .cse7 .cse2 .cse3 .cse8 .cse5 .cse6 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))))) [2022-07-19 10:50:37,820 INFO L895 garLoopResultBuilder]: At program point L173(lines 163 564) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4480)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 .cse2 .cse3 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse4 .cse5) (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 .cse3 (not .cse1) .cse4 .cse5))) [2022-07-19 10:50:37,823 INFO L899 garLoopResultBuilder]: For program point L504(lines 504 509) no Hoare annotation was computed. [2022-07-19 10:50:37,824 INFO L899 garLoopResultBuilder]: For program point L471(lines 471 482) no Hoare annotation was computed. [2022-07-19 10:50:37,824 INFO L899 garLoopResultBuilder]: For program point L471-1(lines 471 482) no Hoare annotation was computed. [2022-07-19 10:50:37,824 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2022-07-19 10:50:37,824 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 213 545) no Hoare annotation was computed. [2022-07-19 10:50:37,824 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 410) no Hoare annotation was computed. [2022-07-19 10:50:37,824 INFO L899 garLoopResultBuilder]: For program point L340(lines 340 344) no Hoare annotation was computed. [2022-07-19 10:50:37,824 INFO L899 garLoopResultBuilder]: For program point L340-2(lines 213 545) no Hoare annotation was computed. [2022-07-19 10:50:37,825 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 549) no Hoare annotation was computed. [2022-07-19 10:50:37,825 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 560) no Hoare annotation was computed. [2022-07-19 10:50:37,825 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 571) no Hoare annotation was computed. [2022-07-19 10:50:37,825 INFO L899 garLoopResultBuilder]: For program point L109-1(lines 76 630) no Hoare annotation was computed. [2022-07-19 10:50:37,826 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 479) no Hoare annotation was computed. [2022-07-19 10:50:37,826 INFO L902 garLoopResultBuilder]: At program point L209(lines 208 549) the Hoare annotation is: true [2022-07-19 10:50:37,826 INFO L895 garLoopResultBuilder]: At program point L143(lines 139 572) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432)) (.cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse5 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse4 .cse5) (and .cse1 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 .cse3 (not .cse0) .cse4 .cse5))) [2022-07-19 10:50:37,826 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-07-19 10:50:37,826 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2022-07-19 10:50:37,826 INFO L902 garLoopResultBuilder]: At program point L640(lines 632 642) the Hoare annotation is: true [2022-07-19 10:50:37,826 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 314) no Hoare annotation was computed. [2022-07-19 10:50:37,827 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 559) no Hoare annotation was computed. [2022-07-19 10:50:37,827 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 570) no Hoare annotation was computed. [2022-07-19 10:50:37,827 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 581) no Hoare annotation was computed. [2022-07-19 10:50:37,827 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2022-07-19 10:50:37,827 INFO L899 garLoopResultBuilder]: For program point L443-2(lines 213 545) no Hoare annotation was computed. [2022-07-19 10:50:37,827 INFO L899 garLoopResultBuilder]: For program point L311(line 311) no Hoare annotation was computed. [2022-07-19 10:50:37,827 INFO L899 garLoopResultBuilder]: For program point L311-2(line 311) no Hoare annotation was computed. [2022-07-19 10:50:37,828 INFO L902 garLoopResultBuilder]: At program point L212(lines 211 548) the Hoare annotation is: true [2022-07-19 10:50:37,828 INFO L895 garLoopResultBuilder]: At program point L179(lines 175 560) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512))) (or (and .cse0 .cse1 .cse2 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4 .cse5) (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 (not .cse1) .cse3 .cse4 .cse5))) [2022-07-19 10:50:37,828 INFO L899 garLoopResultBuilder]: For program point L311-4(line 311) no Hoare annotation was computed. [2022-07-19 10:50:37,828 INFO L895 garLoopResultBuilder]: At program point L113(lines 112 581) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse3 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse7 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|)) (.cse8 (not .cse0)) (.cse5 (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse5) (and .cse7 .cse8 .cse5 .cse6)))) [2022-07-19 10:50:37,828 INFO L899 garLoopResultBuilder]: For program point L311-6(line 311) no Hoare annotation was computed. [2022-07-19 10:50:37,828 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-07-19 10:50:37,829 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 417) no Hoare annotation was computed. [2022-07-19 10:50:37,829 INFO L899 garLoopResultBuilder]: For program point L412-2(lines 412 417) no Hoare annotation was computed. [2022-07-19 10:50:37,829 INFO L899 garLoopResultBuilder]: For program point L313(line 313) no Hoare annotation was computed. [2022-07-19 10:50:37,829 INFO L899 garLoopResultBuilder]: For program point L313-2(line 313) no Hoare annotation was computed. [2022-07-19 10:50:37,829 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 558) no Hoare annotation was computed. [2022-07-19 10:50:37,829 INFO L899 garLoopResultBuilder]: For program point L313-4(line 313) no Hoare annotation was computed. [2022-07-19 10:50:37,829 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 569) no Hoare annotation was computed. [2022-07-19 10:50:37,830 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 580) no Hoare annotation was computed. [2022-07-19 10:50:37,830 INFO L899 garLoopResultBuilder]: For program point L313-6(line 313) no Hoare annotation was computed. [2022-07-19 10:50:37,830 INFO L899 garLoopResultBuilder]: For program point L313-8(lines 310 314) no Hoare annotation was computed. [2022-07-19 10:50:37,830 INFO L895 garLoopResultBuilder]: At program point L149(lines 145 570) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse1 (not .cse2) .cse3 .cse4 .cse5) (and .cse2 .cse0 .cse1 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4 .cse5))) [2022-07-19 10:50:37,830 INFO L895 garLoopResultBuilder]: At program point L546(lines 109 612) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse3 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (.cse11 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse9 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse12 (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse13 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse14 (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse15 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse8 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse16 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse17 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse4 (not .cse7)) (.cse18 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse5 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse10 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse9 .cse5 .cse10) (and .cse7 .cse2 .cse8 .cse11 .cse5 .cse10) (and .cse0 .cse4 .cse12) (and .cse0 .cse13 .cse2 .cse4 .cse5) (and .cse7 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse0 .cse2 .cse4 .cse11 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse9 .cse5 .cse10) (and .cse14 .cse0 .cse4 .cse15) (and .cse7 .cse8 .cse12) (and .cse7 .cse13 .cse2 .cse8 .cse5) (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 1) (and .cse7 .cse14 .cse2 .cse8 .cse5 .cse16) (and .cse7 .cse1 .cse2 .cse8 .cse5 .cse16) (and .cse7 .cse2 .cse17 .cse8 .cse18 .cse5 .cse16) (and .cse7 .cse14 .cse8 .cse15) (and .cse7 .cse2 .cse8 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse5 .cse16) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse2 .cse17 .cse4 .cse18 .cse5 .cse10)))) [2022-07-19 10:50:37,830 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 92) no Hoare annotation was computed. [2022-07-19 10:50:37,831 INFO L902 garLoopResultBuilder]: At program point L613(lines 108 614) the Hoare annotation is: true [2022-07-19 10:50:37,831 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 557) no Hoare annotation was computed. [2022-07-19 10:50:37,831 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 568) no Hoare annotation was computed. [2022-07-19 10:50:37,831 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 579) no Hoare annotation was computed. [2022-07-19 10:50:37,831 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2022-07-19 10:50:37,831 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 10:50:37,831 INFO L899 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2022-07-19 10:50:37,831 INFO L895 garLoopResultBuilder]: At program point L218(lines 115 580) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse1 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|)) (.cse5 (not .cse8)) (.cse7 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse0 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse9 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse5 .cse6))) (and .cse1 .cse4 .cse5 .cse7) (and .cse8 .cse4 .cse9 .cse7) (and (or (and .cse8 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse2 .cse3 .cse4 .cse9)) .cse0) (and .cse0 (let ((.cse10 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))) (or (and .cse8 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse3 .cse4 .cse9 .cse10))))))) [2022-07-19 10:50:37,831 INFO L895 garLoopResultBuilder]: At program point L185(lines 181 558) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512))) (or (and .cse0 .cse1 .cse2 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4 .cse5) (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 (not .cse1) .cse3 .cse4 .cse5))) [2022-07-19 10:50:37,832 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 610) no Hoare annotation was computed. [2022-07-19 10:50:37,832 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 91) no Hoare annotation was computed. [2022-07-19 10:50:37,832 INFO L899 garLoopResultBuilder]: For program point L87-2(lines 84 92) no Hoare annotation was computed. [2022-07-19 10:50:37,832 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 607) no Hoare annotation was computed. [2022-07-19 10:50:37,832 INFO L899 garLoopResultBuilder]: For program point L517-1(lines 213 545) no Hoare annotation was computed. [2022-07-19 10:50:37,832 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 357) no Hoare annotation was computed. [2022-07-19 10:50:37,833 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2022-07-19 10:50:37,833 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 319 333) no Hoare annotation was computed. [2022-07-19 10:50:37,833 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 556) no Hoare annotation was computed. [2022-07-19 10:50:37,833 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 567) no Hoare annotation was computed. [2022-07-19 10:50:37,833 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 578) no Hoare annotation was computed. [2022-07-19 10:50:37,833 INFO L899 garLoopResultBuilder]: For program point L617(lines 617 621) no Hoare annotation was computed. [2022-07-19 10:50:37,833 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 593) no Hoare annotation was computed. [2022-07-19 10:50:37,834 INFO L899 garLoopResultBuilder]: For program point L617-2(lines 617 621) no Hoare annotation was computed. [2022-07-19 10:50:37,834 INFO L899 garLoopResultBuilder]: For program point L584-2(lines 583 605) no Hoare annotation was computed. [2022-07-19 10:50:37,834 INFO L895 garLoopResultBuilder]: At program point L155(lines 151 568) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4448)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 .cse2 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4 .cse5) (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 .cse3 (not .cse1) .cse4 .cse5))) [2022-07-19 10:50:37,834 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2022-07-19 10:50:37,834 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 459) no Hoare annotation was computed. [2022-07-19 10:50:37,834 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 10:50:37,834 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2022-07-19 10:50:37,834 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 555) no Hoare annotation was computed. [2022-07-19 10:50:37,835 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 566) no Hoare annotation was computed. [2022-07-19 10:50:37,835 INFO L899 garLoopResultBuilder]: For program point L223-2(lines 213 545) no Hoare annotation was computed. [2022-07-19 10:50:37,835 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 577) no Hoare annotation was computed. [2022-07-19 10:50:37,835 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2022-07-19 10:50:37,835 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-07-19 10:50:37,835 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 321 333) no Hoare annotation was computed. [2022-07-19 10:50:37,835 INFO L895 garLoopResultBuilder]: At program point L191(lines 187 556) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 .cse2 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4 .cse5) (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 (not .cse1) .cse3 .cse4 .cse5))) [2022-07-19 10:50:37,836 INFO L899 garLoopResultBuilder]: For program point L522-1(lines 522 526) no Hoare annotation was computed. [2022-07-19 10:50:37,836 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-07-19 10:50:37,836 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2022-07-19 10:50:37,836 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 554) no Hoare annotation was computed. [2022-07-19 10:50:37,836 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 565) no Hoare annotation was computed. [2022-07-19 10:50:37,836 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 576) no Hoare annotation was computed. [2022-07-19 10:50:37,836 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2022-07-19 10:50:37,837 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 76 630) no Hoare annotation was computed. [2022-07-19 10:50:37,837 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 10:50:37,837 INFO L895 garLoopResultBuilder]: At program point L161(lines 157 566) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4464)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse1 (not .cse2) .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse1 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4 .cse5))) [2022-07-19 10:50:37,837 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 99) no Hoare annotation was computed. [2022-07-19 10:50:37,837 INFO L899 garLoopResultBuilder]: For program point L493(lines 493 497) no Hoare annotation was computed. [2022-07-19 10:50:37,837 INFO L899 garLoopResultBuilder]: For program point L493-2(lines 493 497) no Hoare annotation was computed. [2022-07-19 10:50:37,837 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 303) no Hoare annotation was computed. [2022-07-19 10:50:37,838 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 553) no Hoare annotation was computed. [2022-07-19 10:50:37,838 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 564) no Hoare annotation was computed. [2022-07-19 10:50:37,838 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 575) no Hoare annotation was computed. [2022-07-19 10:50:37,838 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-07-19 10:50:37,838 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2022-07-19 10:50:37,838 INFO L895 garLoopResultBuilder]: At program point L197(lines 193 554) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 .cse2 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4) (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 (not .cse1) .cse3 .cse4))) [2022-07-19 10:50:37,838 INFO L895 garLoopResultBuilder]: At program point L131(lines 127 576) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse7 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse1 (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4400)) (.cse4 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse8 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|)) (.cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse9 (not .cse0)) (.cse5 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse10 (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4384))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse4 .cse5 .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and .cse8 .cse2 .cse3 .cse9 .cse5 .cse6 .cse10)))) [2022-07-19 10:50:37,839 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 10:50:37,839 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2022-07-19 10:50:37,839 INFO L895 garLoopResultBuilder]: At program point L363(lines 76 630) the Hoare annotation is: false [2022-07-19 10:50:37,839 INFO L902 garLoopResultBuilder]: At program point L628(lines 76 630) the Hoare annotation is: true [2022-07-19 10:50:37,839 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 601) no Hoare annotation was computed. [2022-07-19 10:50:37,839 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2022-07-19 10:50:37,839 INFO L899 garLoopResultBuilder]: For program point L529-2(lines 529 533) no Hoare annotation was computed. [2022-07-19 10:50:37,840 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 302) no Hoare annotation was computed. [2022-07-19 10:50:37,840 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 213 545) no Hoare annotation was computed. [2022-07-19 10:50:37,840 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 552) no Hoare annotation was computed. [2022-07-19 10:50:37,840 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 563) no Hoare annotation was computed. [2022-07-19 10:50:37,840 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 574) no Hoare annotation was computed. [2022-07-19 10:50:37,840 INFO L902 garLoopResultBuilder]: At program point L629(lines 18 631) the Hoare annotation is: true [2022-07-19 10:50:37,840 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 468) no Hoare annotation was computed. [2022-07-19 10:50:37,843 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:50:37,844 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:50:37,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:50:37 BoogieIcfgContainer [2022-07-19 10:50:37,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:50:37,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:50:37,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:50:37,886 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:50:37,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:50:18" (3/4) ... [2022-07-19 10:50:37,889 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 10:50:37,908 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-07-19 10:50:37,909 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-19 10:50:37,909 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 10:50:37,910 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 10:50:37,993 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 10:50:37,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:50:37,993 INFO L158 Benchmark]: Toolchain (without parser) took 20955.81ms. Allocated memory was 96.5MB in the beginning and 302.0MB in the end (delta: 205.5MB). Free memory was 58.2MB in the beginning and 243.3MB in the end (delta: -185.2MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2022-07-19 10:50:37,994 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 75.5MB in the beginning and 75.4MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:50:37,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.34ms. Allocated memory is still 96.5MB. Free memory was 58.0MB in the beginning and 73.5MB in the end (delta: -15.5MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2022-07-19 10:50:37,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.53ms. Allocated memory is still 96.5MB. Free memory was 73.5MB in the beginning and 70.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 10:50:37,994 INFO L158 Benchmark]: Boogie Preprocessor took 29.17ms. Allocated memory is still 96.5MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:50:37,996 INFO L158 Benchmark]: RCFGBuilder took 649.47ms. Allocated memory is still 96.5MB. Free memory was 68.1MB in the beginning and 37.4MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-07-19 10:50:37,997 INFO L158 Benchmark]: TraceAbstraction took 19813.92ms. Allocated memory was 96.5MB in the beginning and 302.0MB in the end (delta: 205.5MB). Free memory was 37.1MB in the beginning and 250.7MB in the end (delta: -213.6MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. [2022-07-19 10:50:37,998 INFO L158 Benchmark]: Witness Printer took 107.12ms. Allocated memory is still 302.0MB. Free memory was 250.7MB in the beginning and 243.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 10:50:38,003 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.20ms. Allocated memory is still 96.5MB. Free memory was 75.5MB in the beginning and 75.4MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.34ms. Allocated memory is still 96.5MB. Free memory was 58.0MB in the beginning and 73.5MB in the end (delta: -15.5MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.53ms. Allocated memory is still 96.5MB. Free memory was 73.5MB in the beginning and 70.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.17ms. Allocated memory is still 96.5MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 649.47ms. Allocated memory is still 96.5MB. Free memory was 68.1MB in the beginning and 37.4MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19813.92ms. Allocated memory was 96.5MB in the beginning and 302.0MB in the end (delta: 205.5MB). Free memory was 37.1MB in the beginning and 250.7MB in the end (delta: -213.6MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. * Witness Printer took 107.12ms. Allocated memory is still 302.0MB. Free memory was 250.7MB in the beginning and 243.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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: 624]: 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, 134 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 27, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3386 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3386 mSDsluCounter, 8955 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3553 mSDsCounter, 695 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2988 IncrementalHoareTripleChecker+Invalid, 3683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 695 mSolverCounterUnsat, 5402 mSDtfsCounter, 2988 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2178 GetRequests, 2122 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2631occurred in iteration=24, InterpolantAutomatonStates: 99, 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, 1516 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 174 NumberOfFragments, 1294 HoareAnnotationTreeSize, 23 FomulaSimplifications, 27237 FormulaSimplificationTreeSizeReduction, 8.4s HoareSimplificationTime, 23 FomulaSimplificationsInter, 173531 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 5859 NumberOfCodeBlocks, 5859 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 6535 ConstructedInterpolants, 0 QuantifiedInterpolants, 8595 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2442 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 33 InterpolantComputations, 25 PerfectInterpolantSequences, 19517/19606 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: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((208 <= ag_Y && 4384 == s__state) && ag_X <= 4352) && blastFlag == 1) && !(s__hit == 0)) && 4352 <= ag_X) || ((((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && s__state <= 4528) && 4352 <= ag_X) && blastFlag <= 4)) || (((((s__hit == 0 && ag_X <= 4352) && 48 == ag_Z) && 4416 == s__state) && 4352 <= ag_X) && blastFlag <= 4)) || ((208 <= ag_Y && !(s__hit == 0)) && 3 == s__state)) || ((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= ag_X)) || (((((s__hit == 0 && 4384 == s__state) && ag_X <= 4352) && blastFlag == 1) && 48 == ag_Z) && 4352 <= ag_X)) || (((((208 <= ag_Y && ag_X <= 4352) && !(s__hit == 0)) && 4416 == s__state) && 4352 <= ag_X) && blastFlag <= 4)) || ((((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && s__state <= 4528) && 4352 <= ag_X) && blastFlag <= 4)) || (((4368 == s__state && 208 <= ag_Y) && !(s__hit == 0)) && blastFlag == 0)) || ((s__hit == 0 && 48 == ag_Z) && 3 == s__state)) || ((((s__hit == 0 && 2 == blastFlag) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X)) || s__state == 1) || (((((s__hit == 0 && 4368 == s__state) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0)) || (((((s__hit == 0 && 4384 == s__state) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0)) || ((((((s__hit == 0 && ag_X <= 4352) && s__state <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0)) || (((s__hit == 0 && 4368 == s__state) && 48 == ag_Z) && blastFlag == 0)) || (((((s__hit == 0 && ag_X <= 4352) && 48 == ag_Z) && 4560 <= s__state) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0)) || (((((((3 == s__s3__tmp__next_state___0 && 208 <= ag_Y) && ag_X <= 4352) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__hit == 0) && s__state <= 4480) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && blastFlag <= 4) || ((((((4432 <= s__state && 208 <= ag_Y) && s__state <= 4480) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((4352 <= ag_X && (((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && s__state <= 4352) && !(s__hit == 0)) || ((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4560 <= s__state))) || (((208 <= ag_Y && s__state <= 4352) && !(s__hit == 0)) && blastFlag == 0)) || (((s__hit == 0 && s__state <= 4352) && 48 == ag_Z) && blastFlag == 0)) || ((((((s__hit == 0 && 2 == blastFlag) && ag_X <= 4352) && 48 == ag_Z) && 4560 <= s__state) || ((((s__hit == 0 && 2 == blastFlag) && ag_X <= 4352) && s__state <= 4352) && 48 == ag_Z)) && 4352 <= ag_X)) || (4352 <= ag_X && (((((s__hit == 0 && ag_X <= 4352) && 48 == ag_Z) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) || ((((s__hit == 0 && ag_X <= 4352) && s__state <= 4352) && 48 == ag_Z) && 4560 <= s__s3__tmp__next_state___0))) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && blastFlag <= 4) && s__state <= 4512) || ((((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= ag_X) && blastFlag <= 4) && s__state <= 4512) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && blastFlag <= 4) || (((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((s__state <= 4432 && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X) && blastFlag <= 4) || ((((((s__hit == 0 && s__state <= 4432) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((((s__hit == 0 && s__state < 4400) && 2 == blastFlag) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) || ((((s__hit == 0 && s__state < 4400) && 48 == ag_Z) && 4352 <= s__state) && blastFlag == 0)) || ((((208 <= ag_Y && !(s__hit == 0)) && 4352 <= s__state) && s__state < 4384) && blastFlag == 0)) || ((((((s__hit == 0 && s__state < 4400) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0)) || ((((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X) && s__state < 4384) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((s__hit == 0 && 2 == blastFlag) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && 12292 == s__state) || (((s__hit == 0 && 48 == ag_Z) && 12292 == s__state) && blastFlag == 0)) || (((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= ag_X) && 12292 == s__state)) || (((((s__hit == 0 && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0) && 12292 == s__state)) || (((208 <= ag_Y && !(s__hit == 0)) && 12292 == s__state) && blastFlag == 0) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4560 <= s__state) && 4352 <= ag_X) || ((4432 <= s__state && s__hit == 0) && 48 == ag_Z) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && s__state <= 4464) && 4352 <= ag_X) && blastFlag <= 4) || ((((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && s__state <= 4464) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((((((((s__state < 4400 && 208 <= ag_Y) && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X) || ((((((s__hit == 0 && s__state < 4400) && 2 == blastFlag) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X)) || ((((((s__state < 4400 && 208 <= ag_Y) && ag_X <= 4352) && blastFlag == 1) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X)) || ((((((s__hit == 0 && s__state < 4400) && ag_X <= 4352) && blastFlag == 1) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X)) || ((((((s__hit == 0 && s__state < 4400) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && s__state <= 4528) && 4352 <= ag_X) && blastFlag <= 4) || ((((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && s__state <= 4528) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && blastFlag <= 4) && s__state <= 4512) || ((((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= ag_X) && blastFlag <= 4) && s__state <= 4512) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((((s__hit == 0 && s__state <= 4432) && 2 == blastFlag) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) || ((((((s__state <= 4432 && 208 <= ag_Y) && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && s__state <= 4448) && 4352 <= ag_X) && blastFlag <= 4) || ((((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && s__state <= 4448) && !(s__hit == 0)) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: ((((((((s__hit == 0 && 2 == blastFlag) && ag_X <= 4352) && s__state <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) || ((((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X)) || ((((((s__hit == 0 && ag_X <= 4352) && s__state <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0)) || (((((((3 == s__s3__tmp__next_state___0 && 208 <= ag_Y) && ag_X <= 4352) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X) && blastFlag <= 4) RESULT: Ultimate proved your program to be correct! [2022-07-19 10:50:38,038 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