./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_clnt_1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl-simplified/s3_clnt_1.cil-1.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 9d22078cc0ed1f6555ed02c6ceb2e5694208de3c10c4e0f5a14ad82c4e25bb79 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:45:32,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:45:32,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:45:32,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:45:32,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:45:32,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:45:32,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:45:32,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:45:32,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:45:32,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:45:32,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:45:32,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:45:32,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:45:32,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:45:32,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:45:32,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:45:32,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:45:32,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:45:32,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:45:32,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:45:32,719 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:45:32,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:45:32,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:45:32,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:45:32,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:45:32,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:45:32,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:45:32,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:45:32,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:45:32,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:45:32,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:45:32,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:45:32,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:45:32,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:45:32,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:45:32,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:45:32,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:45:32,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:45:32,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:45:32,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:45:32,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:45:32,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:45:32,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:45:32,762 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:45:32,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:45:32,763 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:45:32,763 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:45:32,764 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:45:32,764 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:45:32,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:45:32,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:45:32,765 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:45:32,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:45:32,765 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:45:32,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:45:32,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:45:32,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:45:32,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:45:32,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:45:32,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:45:32,766 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:45:32,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:45:32,768 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:45:32,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:45:32,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:45:32,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:45:32,768 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:45:32,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:45:32,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:45:32,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:45:32,769 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:45:32,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:45:32,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:45:32,769 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:45:32,770 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:45:32,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:45:32,770 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 -> 9d22078cc0ed1f6555ed02c6ceb2e5694208de3c10c4e0f5a14ad82c4e25bb79 [2022-07-11 23:45:32,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:45:32,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:45:32,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:45:32,990 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:45:32,991 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:45:32,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_clnt_1.cil-1.c [2022-07-11 23:45:33,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fbacf764/95808397699f4a6ba676170bab3552df/FLAGfa9cea3db [2022-07-11 23:45:33,422 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:45:33,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_1.cil-1.c [2022-07-11 23:45:33,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fbacf764/95808397699f4a6ba676170bab3552df/FLAGfa9cea3db [2022-07-11 23:45:33,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fbacf764/95808397699f4a6ba676170bab3552df [2022-07-11 23:45:33,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:45:33,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:45:33,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:45:33,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:45:33,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:45:33,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:45:33" (1/1) ... [2022-07-11 23:45:33,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf5954e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33, skipping insertion in model container [2022-07-11 23:45:33,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:45:33" (1/1) ... [2022-07-11 23:45:33,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:45:33,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:45:33,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_1.cil-1.c[35497,35510] [2022-07-11 23:45:33,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:45:33,673 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:45:33,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_1.cil-1.c[35497,35510] [2022-07-11 23:45:33,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:45:33,743 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:45:33,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33 WrapperNode [2022-07-11 23:45:33,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:45:33,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:45:33,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:45:33,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:45:33,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33" (1/1) ... [2022-07-11 23:45:33,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33" (1/1) ... [2022-07-11 23:45:33,798 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 506 [2022-07-11 23:45:33,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:45:33,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:45:33,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:45:33,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:45:33,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33" (1/1) ... [2022-07-11 23:45:33,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33" (1/1) ... [2022-07-11 23:45:33,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33" (1/1) ... [2022-07-11 23:45:33,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33" (1/1) ... [2022-07-11 23:45:33,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33" (1/1) ... [2022-07-11 23:45:33,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33" (1/1) ... [2022-07-11 23:45:33,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33" (1/1) ... [2022-07-11 23:45:33,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:45:33,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:45:33,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:45:33,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:45:33,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33" (1/1) ... [2022-07-11 23:45:33,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:45:33,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:33,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:45:33,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:45:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:45:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:45:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:45:33,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:45:34,005 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:45:34,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:45:34,016 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:45:34,365 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-11 23:45:34,365 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-11 23:45:34,365 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:45:34,370 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:45:34,370 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:45:34,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:45:34 BoogieIcfgContainer [2022-07-11 23:45:34,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:45:34,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:45:34,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:45:34,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:45:34,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:45:33" (1/3) ... [2022-07-11 23:45:34,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ee40ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:45:34, skipping insertion in model container [2022-07-11 23:45:34,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:33" (2/3) ... [2022-07-11 23:45:34,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ee40ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:45:34, skipping insertion in model container [2022-07-11 23:45:34,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:45:34" (3/3) ... [2022-07-11 23:45:34,378 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2022-07-11 23:45:34,387 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:45:34,390 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:45:34,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:45:34,451 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@7c4cd0a4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@666647ed [2022-07-11 23:45:34,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:45:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 125 states have (on average 1.72) internal successors, (215), 126 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:45:34,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:34,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:34,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:34,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1457700990, now seen corresponding path program 1 times [2022-07-11 23:45:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:34,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668159883] [2022-07-11 23:45:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:34,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:45:34,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:34,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668159883] [2022-07-11 23:45:34,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668159883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:34,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:34,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:34,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280178195] [2022-07-11 23:45:34,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:34,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:34,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:34,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:34,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:34,674 INFO L87 Difference]: Start difference. First operand has 127 states, 125 states have (on average 1.72) internal successors, (215), 126 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:34,756 INFO L93 Difference]: Finished difference Result 363 states and 617 transitions. [2022-07-11 23:45:34,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:34,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-11 23:45:34,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:34,772 INFO L225 Difference]: With dead ends: 363 [2022-07-11 23:45:34,772 INFO L226 Difference]: Without dead ends: 211 [2022-07-11 23:45:34,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:34,778 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 178 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:34,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 396 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-11 23:45:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-07-11 23:45:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.5) internal successors, (315), 210 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 315 transitions. [2022-07-11 23:45:34,830 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 315 transitions. Word has length 24 [2022-07-11 23:45:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:34,830 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 315 transitions. [2022-07-11 23:45:34,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 315 transitions. [2022-07-11 23:45:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-11 23:45:34,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:34,834 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-11 23:45:34,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:45:34,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:34,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash 152202379, now seen corresponding path program 1 times [2022-07-11 23:45:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:34,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444344813] [2022-07-11 23:45:34,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:34,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:45:34,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:34,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444344813] [2022-07-11 23:45:34,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444344813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:34,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:34,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:34,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809066977] [2022-07-11 23:45:34,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:34,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:34,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:34,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:34,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:34,908 INFO L87 Difference]: Start difference. First operand 211 states and 315 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:35,023 INFO L93 Difference]: Finished difference Result 340 states and 513 transitions. [2022-07-11 23:45:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:35,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-07-11 23:45:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:35,025 INFO L225 Difference]: With dead ends: 340 [2022-07-11 23:45:35,025 INFO L226 Difference]: Without dead ends: 236 [2022-07-11 23:45:35,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:35,031 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:35,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 258 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-11 23:45:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 228. [2022-07-11 23:45:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.4845814977973568) internal successors, (337), 227 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 337 transitions. [2022-07-11 23:45:35,041 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 337 transitions. Word has length 38 [2022-07-11 23:45:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:35,042 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 337 transitions. [2022-07-11 23:45:35,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2022-07-11 23:45:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-11 23:45:35,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:35,044 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:35,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:45:35,044 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:35,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:35,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1281794544, now seen corresponding path program 1 times [2022-07-11 23:45:35,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:35,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965781770] [2022-07-11 23:45:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:45:35,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:35,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965781770] [2022-07-11 23:45:35,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965781770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:35,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:35,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:35,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722585086] [2022-07-11 23:45:35,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:35,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:35,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:35,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:35,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:35,104 INFO L87 Difference]: Start difference. First operand 228 states and 337 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:35,233 INFO L93 Difference]: Finished difference Result 551 states and 841 transitions. [2022-07-11 23:45:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:35,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 55 [2022-07-11 23:45:35,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:35,235 INFO L225 Difference]: With dead ends: 551 [2022-07-11 23:45:35,235 INFO L226 Difference]: Without dead ends: 328 [2022-07-11 23:45:35,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:35,240 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:35,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 222 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:35,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-11 23:45:35,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 310. [2022-07-11 23:45:35,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4142394822006472) internal successors, (437), 309 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2022-07-11 23:45:35,263 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 55 [2022-07-11 23:45:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:35,264 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2022-07-11 23:45:35,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2022-07-11 23:45:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-11 23:45:35,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:35,269 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:35,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:45:35,270 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:35,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:35,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1258017753, now seen corresponding path program 1 times [2022-07-11 23:45:35,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:35,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581436707] [2022-07-11 23:45:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:35,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:45:35,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:35,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581436707] [2022-07-11 23:45:35,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581436707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:35,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:35,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:35,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982634514] [2022-07-11 23:45:35,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:35,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:35,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:35,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:35,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:35,340 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:35,419 INFO L93 Difference]: Finished difference Result 659 states and 942 transitions. [2022-07-11 23:45:35,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:35,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-07-11 23:45:35,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:35,421 INFO L225 Difference]: With dead ends: 659 [2022-07-11 23:45:35,421 INFO L226 Difference]: Without dead ends: 356 [2022-07-11 23:45:35,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:35,422 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 14 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:35,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 261 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-07-11 23:45:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 348. [2022-07-11 23:45:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.3976945244956773) internal successors, (485), 347 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 485 transitions. [2022-07-11 23:45:35,429 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 485 transitions. Word has length 68 [2022-07-11 23:45:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:35,429 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 485 transitions. [2022-07-11 23:45:35,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 485 transitions. [2022-07-11 23:45:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-11 23:45:35,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:35,432 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2022-07-11 23:45:35,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:45:35,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:35,434 INFO L85 PathProgramCache]: Analyzing trace with hash 181274982, now seen corresponding path program 1 times [2022-07-11 23:45:35,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:35,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663528709] [2022-07-11 23:45:35,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:35,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:45:35,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:35,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663528709] [2022-07-11 23:45:35,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663528709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:35,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:35,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:35,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078838886] [2022-07-11 23:45:35,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:35,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:35,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:35,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:35,496 INFO L87 Difference]: Start difference. First operand 348 states and 485 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:35,659 INFO L93 Difference]: Finished difference Result 828 states and 1180 transitions. [2022-07-11 23:45:35,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:35,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-07-11 23:45:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:35,661 INFO L225 Difference]: With dead ends: 828 [2022-07-11 23:45:35,661 INFO L226 Difference]: Without dead ends: 485 [2022-07-11 23:45:35,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:35,662 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 126 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:35,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 172 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:45:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-07-11 23:45:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 459. [2022-07-11 23:45:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.4323144104803494) internal successors, (656), 458 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 656 transitions. [2022-07-11 23:45:35,697 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 656 transitions. Word has length 81 [2022-07-11 23:45:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:35,698 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 656 transitions. [2022-07-11 23:45:35,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 656 transitions. [2022-07-11 23:45:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-11 23:45:35,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:35,699 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] [2022-07-11 23:45:35,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:45:35,700 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash -901961809, now seen corresponding path program 1 times [2022-07-11 23:45:35,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:35,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932604650] [2022-07-11 23:45:35,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-11 23:45:35,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:35,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932604650] [2022-07-11 23:45:35,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932604650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:35,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:35,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:35,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646565068] [2022-07-11 23:45:35,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:35,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:35,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:35,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:35,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:35,741 INFO L87 Difference]: Start difference. First operand 459 states and 656 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:35,823 INFO L93 Difference]: Finished difference Result 926 states and 1341 transitions. [2022-07-11 23:45:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:35,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 84 [2022-07-11 23:45:35,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:35,825 INFO L225 Difference]: With dead ends: 926 [2022-07-11 23:45:35,826 INFO L226 Difference]: Without dead ends: 507 [2022-07-11 23:45:35,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:35,827 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:35,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 260 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:35,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-07-11 23:45:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 501. [2022-07-11 23:45:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.416) internal successors, (708), 500 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 708 transitions. [2022-07-11 23:45:35,851 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 708 transitions. Word has length 84 [2022-07-11 23:45:35,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:35,853 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 708 transitions. [2022-07-11 23:45:35,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 708 transitions. [2022-07-11 23:45:35,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-11 23:45:35,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:35,855 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] [2022-07-11 23:45:35,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:45:35,855 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:35,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:35,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1810291289, now seen corresponding path program 1 times [2022-07-11 23:45:35,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:35,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203750793] [2022-07-11 23:45:35,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:35,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-11 23:45:35,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:35,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203750793] [2022-07-11 23:45:35,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203750793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:35,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:35,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:35,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390474654] [2022-07-11 23:45:35,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:35,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:35,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:35,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:35,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:35,908 INFO L87 Difference]: Start difference. First operand 501 states and 708 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:35,930 INFO L93 Difference]: Finished difference Result 980 states and 1398 transitions. [2022-07-11 23:45:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:35,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 104 [2022-07-11 23:45:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:35,933 INFO L225 Difference]: With dead ends: 980 [2022-07-11 23:45:35,933 INFO L226 Difference]: Without dead ends: 739 [2022-07-11 23:45:35,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:35,934 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 125 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:35,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 464 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-07-11 23:45:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2022-07-11 23:45:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.4173441734417345) internal successors, (1046), 738 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1046 transitions. [2022-07-11 23:45:35,945 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1046 transitions. Word has length 104 [2022-07-11 23:45:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:35,945 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 1046 transitions. [2022-07-11 23:45:35,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1046 transitions. [2022-07-11 23:45:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-11 23:45:35,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:35,947 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] [2022-07-11 23:45:35,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:45:35,947 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash 151283369, now seen corresponding path program 1 times [2022-07-11 23:45:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:35,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277490554] [2022-07-11 23:45:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:35,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-11 23:45:35,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:35,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277490554] [2022-07-11 23:45:35,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277490554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:35,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:35,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:35,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474113697] [2022-07-11 23:45:35,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:35,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:35,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:35,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:35,996 INFO L87 Difference]: Start difference. First operand 739 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:36,016 INFO L93 Difference]: Finished difference Result 1239 states and 1758 transitions. [2022-07-11 23:45:36,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:36,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 104 [2022-07-11 23:45:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:36,020 INFO L225 Difference]: With dead ends: 1239 [2022-07-11 23:45:36,020 INFO L226 Difference]: Without dead ends: 760 [2022-07-11 23:45:36,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,021 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 11 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:36,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 345 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-07-11 23:45:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2022-07-11 23:45:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 1.4137022397891963) internal successors, (1073), 759 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1073 transitions. [2022-07-11 23:45:36,056 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1073 transitions. Word has length 104 [2022-07-11 23:45:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:36,056 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1073 transitions. [2022-07-11 23:45:36,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1073 transitions. [2022-07-11 23:45:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-11 23:45:36,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:36,058 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:36,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:45:36,058 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:36,058 INFO L85 PathProgramCache]: Analyzing trace with hash -492994255, now seen corresponding path program 1 times [2022-07-11 23:45:36,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:36,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941136004] [2022-07-11 23:45:36,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:36,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-11 23:45:36,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:36,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941136004] [2022-07-11 23:45:36,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941136004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:36,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:36,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772741693] [2022-07-11 23:45:36,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:36,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:36,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:36,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:36,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,085 INFO L87 Difference]: Start difference. First operand 760 states and 1073 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-11 23:45:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:36,108 INFO L93 Difference]: Finished difference Result 1001 states and 1419 transitions. [2022-07-11 23:45:36,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:36,109 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 106 [2022-07-11 23:45:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:36,111 INFO L225 Difference]: With dead ends: 1001 [2022-07-11 23:45:36,111 INFO L226 Difference]: Without dead ends: 999 [2022-07-11 23:45:36,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,112 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 138 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:36,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 303 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-07-11 23:45:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 999. [2022-07-11 23:45:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 998 states have (on average 1.4198396793587174) internal successors, (1417), 998 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1417 transitions. [2022-07-11 23:45:36,126 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1417 transitions. Word has length 106 [2022-07-11 23:45:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:36,126 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1417 transitions. [2022-07-11 23:45:36,126 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-11 23:45:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1417 transitions. [2022-07-11 23:45:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-11 23:45:36,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:36,128 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1] [2022-07-11 23:45:36,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:45:36,128 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:36,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1913560025, now seen corresponding path program 1 times [2022-07-11 23:45:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:36,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109985217] [2022-07-11 23:45:36,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:36,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-11 23:45:36,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:36,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109985217] [2022-07-11 23:45:36,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109985217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:36,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:36,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:36,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894216112] [2022-07-11 23:45:36,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:36,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:36,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:36,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:36,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,157 INFO L87 Difference]: Start difference. First operand 999 states and 1417 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:36,240 INFO L93 Difference]: Finished difference Result 2064 states and 2956 transitions. [2022-07-11 23:45:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:36,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-07-11 23:45:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:36,244 INFO L225 Difference]: With dead ends: 2064 [2022-07-11 23:45:36,244 INFO L226 Difference]: Without dead ends: 1105 [2022-07-11 23:45:36,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,245 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:36,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 259 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2022-07-11 23:45:36,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1091. [2022-07-11 23:45:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1090 states have (on average 1.4027522935779817) internal successors, (1529), 1090 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1529 transitions. [2022-07-11 23:45:36,260 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1529 transitions. Word has length 131 [2022-07-11 23:45:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:36,261 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 1529 transitions. [2022-07-11 23:45:36,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1529 transitions. [2022-07-11 23:45:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-11 23:45:36,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:36,263 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1, 1] [2022-07-11 23:45:36,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:45:36,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:36,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:36,263 INFO L85 PathProgramCache]: Analyzing trace with hash 296450083, now seen corresponding path program 1 times [2022-07-11 23:45:36,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:36,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605196800] [2022-07-11 23:45:36,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:36,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-07-11 23:45:36,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:36,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605196800] [2022-07-11 23:45:36,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605196800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:36,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:36,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:36,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595750315] [2022-07-11 23:45:36,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:36,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:36,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:36,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,302 INFO L87 Difference]: Start difference. First operand 1091 states and 1529 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:36,418 INFO L93 Difference]: Finished difference Result 2346 states and 3350 transitions. [2022-07-11 23:45:36,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:36,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 152 [2022-07-11 23:45:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:36,422 INFO L225 Difference]: With dead ends: 2346 [2022-07-11 23:45:36,422 INFO L226 Difference]: Without dead ends: 1287 [2022-07-11 23:45:36,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,424 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 66 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:36,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 211 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2022-07-11 23:45:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1247. [2022-07-11 23:45:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1246 states have (on average 1.4069020866773676) internal successors, (1753), 1246 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1753 transitions. [2022-07-11 23:45:36,445 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1753 transitions. Word has length 152 [2022-07-11 23:45:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:36,445 INFO L495 AbstractCegarLoop]: Abstraction has 1247 states and 1753 transitions. [2022-07-11 23:45:36,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1753 transitions. [2022-07-11 23:45:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-11 23:45:36,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:36,448 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2022-07-11 23:45:36,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:45:36,448 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:36,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:36,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2080513012, now seen corresponding path program 1 times [2022-07-11 23:45:36,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:36,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96397613] [2022-07-11 23:45:36,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:36,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-07-11 23:45:36,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:36,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96397613] [2022-07-11 23:45:36,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96397613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:36,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:36,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:36,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150435699] [2022-07-11 23:45:36,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:36,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:36,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:36,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:36,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,486 INFO L87 Difference]: Start difference. First operand 1247 states and 1753 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:36,569 INFO L93 Difference]: Finished difference Result 2574 states and 3602 transitions. [2022-07-11 23:45:36,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:36,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 188 [2022-07-11 23:45:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:36,573 INFO L225 Difference]: With dead ends: 2574 [2022-07-11 23:45:36,573 INFO L226 Difference]: Without dead ends: 1367 [2022-07-11 23:45:36,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,575 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:36,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 260 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-07-11 23:45:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1359. [2022-07-11 23:45:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1358 states have (on average 1.3880706921944035) internal successors, (1885), 1358 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1885 transitions. [2022-07-11 23:45:36,603 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1885 transitions. Word has length 188 [2022-07-11 23:45:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:36,604 INFO L495 AbstractCegarLoop]: Abstraction has 1359 states and 1885 transitions. [2022-07-11 23:45:36,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1885 transitions. [2022-07-11 23:45:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-11 23:45:36,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:36,607 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2022-07-11 23:45:36,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:45:36,608 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1653754506, now seen corresponding path program 1 times [2022-07-11 23:45:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:36,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052775340] [2022-07-11 23:45:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-07-11 23:45:36,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:36,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052775340] [2022-07-11 23:45:36,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052775340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:36,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:36,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:36,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008411623] [2022-07-11 23:45:36,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:36,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:36,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:36,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,661 INFO L87 Difference]: Start difference. First operand 1359 states and 1885 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:36,758 INFO L93 Difference]: Finished difference Result 2814 states and 3902 transitions. [2022-07-11 23:45:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:36,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 188 [2022-07-11 23:45:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:36,762 INFO L225 Difference]: With dead ends: 2814 [2022-07-11 23:45:36,763 INFO L226 Difference]: Without dead ends: 1495 [2022-07-11 23:45:36,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,765 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 261 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-11 23:45:36,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 261 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-07-11 23:45:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1483. [2022-07-11 23:45:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1482 states have (on average 1.3690958164642375) internal successors, (2029), 1482 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 2029 transitions. [2022-07-11 23:45:36,789 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 2029 transitions. Word has length 188 [2022-07-11 23:45:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:36,790 INFO L495 AbstractCegarLoop]: Abstraction has 1483 states and 2029 transitions. [2022-07-11 23:45:36,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2029 transitions. [2022-07-11 23:45:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-07-11 23:45:36,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:36,794 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:36,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:45:36,794 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:36,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:36,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1229348372, now seen corresponding path program 1 times [2022-07-11 23:45:36,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:36,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922110623] [2022-07-11 23:45:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:36,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-07-11 23:45:36,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:36,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922110623] [2022-07-11 23:45:36,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922110623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:36,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:36,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:36,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540032289] [2022-07-11 23:45:36,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:36,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:36,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:36,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:36,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,849 INFO L87 Difference]: Start difference. First operand 1483 states and 2029 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:36,883 INFO L93 Difference]: Finished difference Result 4365 states and 5987 transitions. [2022-07-11 23:45:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:36,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2022-07-11 23:45:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:36,892 INFO L225 Difference]: With dead ends: 4365 [2022-07-11 23:45:36,892 INFO L226 Difference]: Without dead ends: 2922 [2022-07-11 23:45:36,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:36,895 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 126 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:36,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 482 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-07-11 23:45:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2920. [2022-07-11 23:45:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2919 states have (on average 1.3706748886605002) internal successors, (4001), 2919 states have internal predecessors, (4001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4001 transitions. [2022-07-11 23:45:36,953 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4001 transitions. Word has length 218 [2022-07-11 23:45:36,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:36,953 INFO L495 AbstractCegarLoop]: Abstraction has 2920 states and 4001 transitions. [2022-07-11 23:45:36,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4001 transitions. [2022-07-11 23:45:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-07-11 23:45:36,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:36,958 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:36,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:45:36,958 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:36,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1790048150, now seen corresponding path program 1 times [2022-07-11 23:45:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:36,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279647470] [2022-07-11 23:45:36,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:36,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-11 23:45:37,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:37,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279647470] [2022-07-11 23:45:37,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279647470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:37,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:37,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:37,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814010236] [2022-07-11 23:45:37,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:37,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:37,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:37,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:37,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:37,005 INFO L87 Difference]: Start difference. First operand 2920 states and 4001 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:37,119 INFO L93 Difference]: Finished difference Result 6100 states and 8366 transitions. [2022-07-11 23:45:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:37,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2022-07-11 23:45:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:37,127 INFO L225 Difference]: With dead ends: 6100 [2022-07-11 23:45:37,127 INFO L226 Difference]: Without dead ends: 3220 [2022-07-11 23:45:37,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:37,132 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:37,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 261 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2022-07-11 23:45:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 3204. [2022-07-11 23:45:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 3203 states have (on average 1.3502965969403684) internal successors, (4325), 3203 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 4325 transitions. [2022-07-11 23:45:37,194 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 4325 transitions. Word has length 218 [2022-07-11 23:45:37,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:37,216 INFO L495 AbstractCegarLoop]: Abstraction has 3204 states and 4325 transitions. [2022-07-11 23:45:37,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 4325 transitions. [2022-07-11 23:45:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-07-11 23:45:37,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:37,225 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:37,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:45:37,225 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash 678419774, now seen corresponding path program 1 times [2022-07-11 23:45:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:37,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455761215] [2022-07-11 23:45:37,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:37,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-07-11 23:45:37,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:37,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455761215] [2022-07-11 23:45:37,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455761215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:37,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:37,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:37,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886864552] [2022-07-11 23:45:37,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:37,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:37,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:37,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:37,266 INFO L87 Difference]: Start difference. First operand 3204 states and 4325 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 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-11 23:45:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:37,383 INFO L93 Difference]: Finished difference Result 6516 states and 8798 transitions. [2022-07-11 23:45:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:37,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 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 242 [2022-07-11 23:45:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:37,391 INFO L225 Difference]: With dead ends: 6516 [2022-07-11 23:45:37,391 INFO L226 Difference]: Without dead ends: 3352 [2022-07-11 23:45:37,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:37,394 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:37,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 260 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2022-07-11 23:45:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 3336. [2022-07-11 23:45:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3335 states have (on average 1.3424287856071964) internal successors, (4477), 3335 states have internal predecessors, (4477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4477 transitions. [2022-07-11 23:45:37,458 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4477 transitions. Word has length 242 [2022-07-11 23:45:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:37,458 INFO L495 AbstractCegarLoop]: Abstraction has 3336 states and 4477 transitions. [2022-07-11 23:45:37,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 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-11 23:45:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4477 transitions. [2022-07-11 23:45:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-11 23:45:37,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:37,463 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:37,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:45:37,463 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:37,463 INFO L85 PathProgramCache]: Analyzing trace with hash -101941725, now seen corresponding path program 1 times [2022-07-11 23:45:37,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:37,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845953011] [2022-07-11 23:45:37,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:37,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-07-11 23:45:37,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:37,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845953011] [2022-07-11 23:45:37,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845953011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:37,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:37,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389358775] [2022-07-11 23:45:37,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:37,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:37,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:37,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:37,513 INFO L87 Difference]: Start difference. First operand 3336 states and 4477 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:37,642 INFO L93 Difference]: Finished difference Result 7032 states and 9578 transitions. [2022-07-11 23:45:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-07-11 23:45:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:37,652 INFO L225 Difference]: With dead ends: 7032 [2022-07-11 23:45:37,652 INFO L226 Difference]: Without dead ends: 3736 [2022-07-11 23:45:37,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:37,655 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:37,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 253 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2022-07-11 23:45:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3648. [2022-07-11 23:45:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3648 states, 3647 states have (on average 1.3284891691801481) internal successors, (4845), 3647 states have internal predecessors, (4845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 4845 transitions. [2022-07-11 23:45:37,722 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 4845 transitions. Word has length 253 [2022-07-11 23:45:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:37,722 INFO L495 AbstractCegarLoop]: Abstraction has 3648 states and 4845 transitions. [2022-07-11 23:45:37,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 4845 transitions. [2022-07-11 23:45:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-11 23:45:37,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:37,727 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:37,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:45:37,728 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:37,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:37,728 INFO L85 PathProgramCache]: Analyzing trace with hash 324455461, now seen corresponding path program 1 times [2022-07-11 23:45:37,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:37,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821088145] [2022-07-11 23:45:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:37,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-07-11 23:45:37,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:37,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821088145] [2022-07-11 23:45:37,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821088145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:37,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:37,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:37,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440641451] [2022-07-11 23:45:37,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:37,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:37,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:37,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:37,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:37,767 INFO L87 Difference]: Start difference. First operand 3648 states and 4845 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-11 23:45:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:37,888 INFO L93 Difference]: Finished difference Result 7664 states and 10122 transitions. [2022-07-11 23:45:37,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:37,889 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 267 [2022-07-11 23:45:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:37,916 INFO L225 Difference]: With dead ends: 7664 [2022-07-11 23:45:37,916 INFO L226 Difference]: Without dead ends: 4056 [2022-07-11 23:45:37,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:37,921 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 135 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:37,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 139 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2022-07-11 23:45:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3768. [2022-07-11 23:45:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3768 states, 3767 states have (on average 1.3243960711441465) internal successors, (4989), 3767 states have internal predecessors, (4989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 4989 transitions. [2022-07-11 23:45:38,020 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 4989 transitions. Word has length 267 [2022-07-11 23:45:38,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:38,020 INFO L495 AbstractCegarLoop]: Abstraction has 3768 states and 4989 transitions. [2022-07-11 23:45:38,021 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-11 23:45:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 4989 transitions. [2022-07-11 23:45:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-11 23:45:38,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:38,029 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:38,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:45:38,030 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:38,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:38,030 INFO L85 PathProgramCache]: Analyzing trace with hash 842255411, now seen corresponding path program 1 times [2022-07-11 23:45:38,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:38,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817958079] [2022-07-11 23:45:38,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:38,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2022-07-11 23:45:38,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:38,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817958079] [2022-07-11 23:45:38,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817958079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:38,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:38,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:38,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813416563] [2022-07-11 23:45:38,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:38,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:38,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:38,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:38,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:38,096 INFO L87 Difference]: Start difference. First operand 3768 states and 4989 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:38,172 INFO L93 Difference]: Finished difference Result 10720 states and 14279 transitions. [2022-07-11 23:45:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:38,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-11 23:45:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:38,183 INFO L225 Difference]: With dead ends: 10720 [2022-07-11 23:45:38,184 INFO L226 Difference]: Without dead ends: 6992 [2022-07-11 23:45:38,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:38,189 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 83 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:38,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 469 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6992 states. [2022-07-11 23:45:38,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6992 to 6990. [2022-07-11 23:45:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6990 states, 6989 states have (on average 1.3325225354127914) internal successors, (9313), 6989 states have internal predecessors, (9313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6990 states to 6990 states and 9313 transitions. [2022-07-11 23:45:38,301 INFO L78 Accepts]: Start accepts. Automaton has 6990 states and 9313 transitions. Word has length 268 [2022-07-11 23:45:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:38,301 INFO L495 AbstractCegarLoop]: Abstraction has 6990 states and 9313 transitions. [2022-07-11 23:45:38,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 6990 states and 9313 transitions. [2022-07-11 23:45:38,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-11 23:45:38,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:38,322 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:38,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:45:38,323 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:38,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:38,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1556363552, now seen corresponding path program 1 times [2022-07-11 23:45:38,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:38,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279775922] [2022-07-11 23:45:38,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:38,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2022-07-11 23:45:38,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:38,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279775922] [2022-07-11 23:45:38,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279775922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:38,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:38,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:38,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418804748] [2022-07-11 23:45:38,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:38,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:38,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:38,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:38,360 INFO L87 Difference]: Start difference. First operand 6990 states and 9313 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:38,509 INFO L93 Difference]: Finished difference Result 13948 states and 18570 transitions. [2022-07-11 23:45:38,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:38,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 269 [2022-07-11 23:45:38,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:38,524 INFO L225 Difference]: With dead ends: 13948 [2022-07-11 23:45:38,524 INFO L226 Difference]: Without dead ends: 6998 [2022-07-11 23:45:38,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:38,533 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:38,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 256 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6998 states. [2022-07-11 23:45:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6998 to 6966. [2022-07-11 23:45:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6966 states, 6965 states have (on average 1.3061019382627423) internal successors, (9097), 6965 states have internal predecessors, (9097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 9097 transitions. [2022-07-11 23:45:38,680 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 9097 transitions. Word has length 269 [2022-07-11 23:45:38,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:38,681 INFO L495 AbstractCegarLoop]: Abstraction has 6966 states and 9097 transitions. [2022-07-11 23:45:38,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 9097 transitions. [2022-07-11 23:45:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-07-11 23:45:38,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:38,691 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:38,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:45:38,692 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1277617296, now seen corresponding path program 1 times [2022-07-11 23:45:38,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:38,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843317617] [2022-07-11 23:45:38,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:38,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-07-11 23:45:38,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:38,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843317617] [2022-07-11 23:45:38,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843317617] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:45:38,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119093141] [2022-07-11 23:45:38,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:38,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:38,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:38,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:45:38,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:45:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:38,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:45:38,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-07-11 23:45:39,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:45:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-07-11 23:45:39,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119093141] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:45:39,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:45:39,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-11 23:45:39,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078250822] [2022-07-11 23:45:39,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:45:39,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:45:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:39,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:45:39,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:45:39,112 INFO L87 Difference]: Start difference. First operand 6966 states and 9097 transitions. Second operand has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:39,549 INFO L93 Difference]: Finished difference Result 18432 states and 24463 transitions. [2022-07-11 23:45:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:45:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 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 292 [2022-07-11 23:45:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:39,567 INFO L225 Difference]: With dead ends: 18432 [2022-07-11 23:45:39,567 INFO L226 Difference]: Without dead ends: 11450 [2022-07-11 23:45:39,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:45:39,577 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 217 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:39,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 898 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:45:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2022-07-11 23:45:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 9800. [2022-07-11 23:45:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9800 states, 9799 states have (on average 1.3263598326359833) internal successors, (12997), 9799 states have internal predecessors, (12997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9800 states to 9800 states and 12997 transitions. [2022-07-11 23:45:39,790 INFO L78 Accepts]: Start accepts. Automaton has 9800 states and 12997 transitions. Word has length 292 [2022-07-11 23:45:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:39,790 INFO L495 AbstractCegarLoop]: Abstraction has 9800 states and 12997 transitions. [2022-07-11 23:45:39,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 9800 states and 12997 transitions. [2022-07-11 23:45:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-07-11 23:45:39,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:39,807 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 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] [2022-07-11 23:45:39,838 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-11 23:45:40,031 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,SelfDestructingSolverStorable20 [2022-07-11 23:45:40,032 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:40,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:40,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1037661491, now seen corresponding path program 2 times [2022-07-11 23:45:40,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:40,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973049927] [2022-07-11 23:45:40,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:40,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-07-11 23:45:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:40,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973049927] [2022-07-11 23:45:40,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973049927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:45:40,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721594714] [2022-07-11 23:45:40,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:45:40,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:40,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:40,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:45:40,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:45:40,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:45:40,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:45:40,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:45:40,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2022-07-11 23:45:40,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:45:40,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721594714] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:40,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:45:40,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:45:40,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830828441] [2022-07-11 23:45:40,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:40,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:40,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:40,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:40,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:45:40,300 INFO L87 Difference]: Start difference. First operand 9800 states and 12997 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:40,491 INFO L93 Difference]: Finished difference Result 19604 states and 25974 transitions. [2022-07-11 23:45:40,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:40,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-11 23:45:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:40,507 INFO L225 Difference]: With dead ends: 19604 [2022-07-11 23:45:40,508 INFO L226 Difference]: Without dead ends: 9844 [2022-07-11 23:45:40,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:45:40,519 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 53 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:40,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 236 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9844 states. [2022-07-11 23:45:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9844 to 8988. [2022-07-11 23:45:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8988 states, 8987 states have (on average 1.2837431845999778) internal successors, (11537), 8987 states have internal predecessors, (11537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8988 states to 8988 states and 11537 transitions. [2022-07-11 23:45:40,659 INFO L78 Accepts]: Start accepts. Automaton has 8988 states and 11537 transitions. Word has length 305 [2022-07-11 23:45:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:40,660 INFO L495 AbstractCegarLoop]: Abstraction has 8988 states and 11537 transitions. [2022-07-11 23:45:40,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 8988 states and 11537 transitions. [2022-07-11 23:45:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2022-07-11 23:45:40,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:40,697 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:40,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:45:40,899 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,SelfDestructingSolverStorable21 [2022-07-11 23:45:40,900 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:40,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:40,900 INFO L85 PathProgramCache]: Analyzing trace with hash 650041975, now seen corresponding path program 1 times [2022-07-11 23:45:40,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:40,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416958240] [2022-07-11 23:45:40,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:40,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-11 23:45:40,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:40,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416958240] [2022-07-11 23:45:40,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416958240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:45:40,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752735870] [2022-07-11 23:45:40,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:40,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:40,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:40,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:45:40,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:45:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:41,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:45:41,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2022-07-11 23:45:41,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:45:41,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752735870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:41,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:45:41,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:45:41,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993583302] [2022-07-11 23:45:41,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:41,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:41,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:41,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:45:41,315 INFO L87 Difference]: Start difference. First operand 8988 states and 11537 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:41,425 INFO L93 Difference]: Finished difference Result 22010 states and 28224 transitions. [2022-07-11 23:45:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:41,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 372 [2022-07-11 23:45:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:41,447 INFO L225 Difference]: With dead ends: 22010 [2022-07-11 23:45:41,447 INFO L226 Difference]: Without dead ends: 13062 [2022-07-11 23:45:41,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:45:41,458 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 61 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:41,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 472 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13062 states. [2022-07-11 23:45:41,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13062 to 13062. [2022-07-11 23:45:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13062 states, 13061 states have (on average 1.2796110558150218) internal successors, (16713), 13061 states have internal predecessors, (16713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13062 states to 13062 states and 16713 transitions. [2022-07-11 23:45:41,684 INFO L78 Accepts]: Start accepts. Automaton has 13062 states and 16713 transitions. Word has length 372 [2022-07-11 23:45:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:41,684 INFO L495 AbstractCegarLoop]: Abstraction has 13062 states and 16713 transitions. [2022-07-11 23:45:41,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 13062 states and 16713 transitions. [2022-07-11 23:45:41,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-07-11 23:45:41,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:41,703 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:41,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:45:41,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:41,920 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:41,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash -590181313, now seen corresponding path program 1 times [2022-07-11 23:45:41,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:41,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351993191] [2022-07-11 23:45:41,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:41,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-11 23:45:41,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:41,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351993191] [2022-07-11 23:45:41,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351993191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:45:41,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254740739] [2022-07-11 23:45:41,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:41,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:41,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:41,966 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:45:41,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:45:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:42,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:45:42,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-11 23:45:42,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:45:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-11 23:45:42,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254740739] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:45:42,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:45:42,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-11 23:45:42,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350922768] [2022-07-11 23:45:42,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:45:42,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:45:42,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:42,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:45:42,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:45:42,178 INFO L87 Difference]: Start difference. First operand 13062 states and 16713 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:42,515 INFO L93 Difference]: Finished difference Result 29734 states and 37874 transitions. [2022-07-11 23:45:42,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:45:42,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 374 [2022-07-11 23:45:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:42,544 INFO L225 Difference]: With dead ends: 29734 [2022-07-11 23:45:42,544 INFO L226 Difference]: Without dead ends: 16700 [2022-07-11 23:45:42,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:45:42,559 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 434 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:42,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 426 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16700 states. [2022-07-11 23:45:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16700 to 14417. [2022-07-11 23:45:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14417 states, 14416 states have (on average 1.278718091009989) internal successors, (18434), 14416 states have internal predecessors, (18434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14417 states to 14417 states and 18434 transitions. [2022-07-11 23:45:42,857 INFO L78 Accepts]: Start accepts. Automaton has 14417 states and 18434 transitions. Word has length 374 [2022-07-11 23:45:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:42,857 INFO L495 AbstractCegarLoop]: Abstraction has 14417 states and 18434 transitions. [2022-07-11 23:45:42,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 14417 states and 18434 transitions. [2022-07-11 23:45:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2022-07-11 23:45:42,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:42,886 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11 23:45:42,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:45:43,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:43,105 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:43,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1273645298, now seen corresponding path program 1 times [2022-07-11 23:45:43,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:43,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211095636] [2022-07-11 23:45:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-07-11 23:45:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:43,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211095636] [2022-07-11 23:45:43,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211095636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:43,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:43,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952676462] [2022-07-11 23:45:43,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:43,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:43,161 INFO L87 Difference]: Start difference. First operand 14417 states and 18434 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:43,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:43,355 INFO L93 Difference]: Finished difference Result 25708 states and 32305 transitions. [2022-07-11 23:45:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:43,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 413 [2022-07-11 23:45:43,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:43,366 INFO L225 Difference]: With dead ends: 25708 [2022-07-11 23:45:43,366 INFO L226 Difference]: Without dead ends: 5877 [2022-07-11 23:45:43,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:43,380 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:43,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 262 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:43,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5877 states. [2022-07-11 23:45:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5877 to 5476. [2022-07-11 23:45:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5476 states, 5475 states have (on average 1.2622831050228311) internal successors, (6911), 5475 states have internal predecessors, (6911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 6911 transitions. [2022-07-11 23:45:43,460 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 6911 transitions. Word has length 413 [2022-07-11 23:45:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:43,460 INFO L495 AbstractCegarLoop]: Abstraction has 5476 states and 6911 transitions. [2022-07-11 23:45:43,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 6911 transitions. [2022-07-11 23:45:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2022-07-11 23:45:43,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:43,467 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:43,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:45:43,467 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash 381067605, now seen corresponding path program 1 times [2022-07-11 23:45:43,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:43,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791938838] [2022-07-11 23:45:43,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:43,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-07-11 23:45:43,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:43,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791938838] [2022-07-11 23:45:43,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791938838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:45:43,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315426359] [2022-07-11 23:45:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:43,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:43,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:43,520 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:45:43,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 23:45:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:43,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:45:43,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-07-11 23:45:43,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:45:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-07-11 23:45:43,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315426359] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:45:43,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:45:43,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-11 23:45:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96513688] [2022-07-11 23:45:43,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:45:43,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:45:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:43,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:45:43,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:45:43,789 INFO L87 Difference]: Start difference. First operand 5476 states and 6911 transitions. Second operand has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:44,027 INFO L93 Difference]: Finished difference Result 6913 states and 8716 transitions. [2022-07-11 23:45:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:45:44,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 0 states have call successors, (0), 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 442 [2022-07-11 23:45:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:44,028 INFO L225 Difference]: With dead ends: 6913 [2022-07-11 23:45:44,028 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:45:44,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 882 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:45:44,031 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 112 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:44,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 636 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:45:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:45:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:45:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:45:44,033 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 442 [2022-07-11 23:45:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:44,033 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:45:44,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:45:44,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:45:44,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:45:44,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-11 23:45:44,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-11 23:45:44,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-11 23:45:49,049 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 371) no Hoare annotation was computed. [2022-07-11 23:45:49,049 INFO L899 garLoopResultBuilder]: For program point L366-2(lines 366 371) no Hoare annotation was computed. [2022-07-11 23:45:49,049 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 237) no Hoare annotation was computed. [2022-07-11 23:45:49,049 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 495) no Hoare annotation was computed. [2022-07-11 23:45:49,049 INFO L899 garLoopResultBuilder]: For program point L168(lines 168 506) no Hoare annotation was computed. [2022-07-11 23:45:49,049 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 517) no Hoare annotation was computed. [2022-07-11 23:45:49,050 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 106) no Hoare annotation was computed. [2022-07-11 23:45:49,050 INFO L899 garLoopResultBuilder]: For program point L466-1(lines 466 468) no Hoare annotation was computed. [2022-07-11 23:45:49,050 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 270) no Hoare annotation was computed. [2022-07-11 23:45:49,050 INFO L895 garLoopResultBuilder]: At program point L202(lines 198 496) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse3 (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 12292)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse5 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse4 .cse5 .cse3 .cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse4 .cse0 .cse3 .cse2) (and .cse4 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse5 .cse1 .cse2))) [2022-07-11 23:45:49,050 INFO L895 garLoopResultBuilder]: At program point L136(lines 132 518) the Hoare annotation is: (let ((.cse0 (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (.cse1 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse0 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1) .cse1))) [2022-07-11 23:45:49,050 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 105) no Hoare annotation was computed. [2022-07-11 23:45:49,050 INFO L902 garLoopResultBuilder]: At program point L566(lines 558 568) the Hoare annotation is: true [2022-07-11 23:45:49,051 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 337) no Hoare annotation was computed. [2022-07-11 23:45:49,051 INFO L899 garLoopResultBuilder]: For program point L335-2(lines 211 490) no Hoare annotation was computed. [2022-07-11 23:45:49,051 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 405) no Hoare annotation was computed. [2022-07-11 23:45:49,051 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 494) no Hoare annotation was computed. [2022-07-11 23:45:49,051 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 505) no Hoare annotation was computed. [2022-07-11 23:45:49,051 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 516) no Hoare annotation was computed. [2022-07-11 23:45:49,051 INFO L899 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2022-07-11 23:45:49,051 INFO L899 garLoopResultBuilder]: For program point L238(lines 238 241) no Hoare annotation was computed. [2022-07-11 23:45:49,052 INFO L895 garLoopResultBuilder]: At program point L205(lines 204 494) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse2 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse5 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))) (or (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse1 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse3 .cse4 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse1 .cse2 .cse5) (and .cse3 .cse4 .cse0 .cse1 .cse2 .cse5))) [2022-07-11 23:45:49,052 INFO L895 garLoopResultBuilder]: At program point L172(lines 162 508) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse2 (<= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 .cse2) (and .cse0 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse1 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)))) [2022-07-11 23:45:49,052 INFO L899 garLoopResultBuilder]: For program point L437(lines 437 439) no Hoare annotation was computed. [2022-07-11 23:45:49,052 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 493) no Hoare annotation was computed. [2022-07-11 23:45:49,052 INFO L899 garLoopResultBuilder]: For program point L174(lines 174 504) no Hoare annotation was computed. [2022-07-11 23:45:49,052 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 515) no Hoare annotation was computed. [2022-07-11 23:45:49,052 INFO L899 garLoopResultBuilder]: For program point L108-1(lines 86 556) no Hoare annotation was computed. [2022-07-11 23:45:49,052 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 474) no Hoare annotation was computed. [2022-07-11 23:45:49,052 INFO L899 garLoopResultBuilder]: For program point L472-2(lines 472 474) no Hoare annotation was computed. [2022-07-11 23:45:49,053 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 309) no Hoare annotation was computed. [2022-07-11 23:45:49,053 INFO L899 garLoopResultBuilder]: For program point L307-2(lines 211 490) no Hoare annotation was computed. [2022-07-11 23:45:49,053 INFO L902 garLoopResultBuilder]: At program point L208(lines 207 493) the Hoare annotation is: true [2022-07-11 23:45:49,053 INFO L895 garLoopResultBuilder]: At program point L142(lines 138 516) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse2 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 .cse2))) [2022-07-11 23:45:49,053 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-07-11 23:45:49,053 INFO L899 garLoopResultBuilder]: For program point L440(lines 440 444) no Hoare annotation was computed. [2022-07-11 23:45:49,053 INFO L899 garLoopResultBuilder]: For program point L440-2(lines 440 444) no Hoare annotation was computed. [2022-07-11 23:45:49,053 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2022-07-11 23:45:49,053 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 277) no Hoare annotation was computed. [2022-07-11 23:45:49,054 INFO L899 garLoopResultBuilder]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2022-07-11 23:45:49,054 INFO L899 garLoopResultBuilder]: For program point L275-2(lines 211 490) no Hoare annotation was computed. [2022-07-11 23:45:49,054 INFO L902 garLoopResultBuilder]: At program point L210(lines 209 493) the Hoare annotation is: true [2022-07-11 23:45:49,054 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 503) no Hoare annotation was computed. [2022-07-11 23:45:49,054 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 514) no Hoare annotation was computed. [2022-07-11 23:45:49,054 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 525) no Hoare annotation was computed. [2022-07-11 23:45:49,054 INFO L895 garLoopResultBuilder]: At program point L178(lines 174 504) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse2 (<= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 .cse2) (and .cse0 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse1 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)))) [2022-07-11 23:45:49,054 INFO L895 garLoopResultBuilder]: At program point L112(lines 111 525) the Hoare annotation is: (and (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-07-11 23:45:49,054 INFO L899 garLoopResultBuilder]: For program point L410(lines 410 412) no Hoare annotation was computed. [2022-07-11 23:45:49,055 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 379) no Hoare annotation was computed. [2022-07-11 23:45:49,055 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 502) no Hoare annotation was computed. [2022-07-11 23:45:49,055 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 513) no Hoare annotation was computed. [2022-07-11 23:45:49,056 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 524) no Hoare annotation was computed. [2022-07-11 23:45:49,056 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 480) no Hoare annotation was computed. [2022-07-11 23:45:49,056 INFO L899 garLoopResultBuilder]: For program point L478-2(lines 478 480) no Hoare annotation was computed. [2022-07-11 23:45:49,056 INFO L895 garLoopResultBuilder]: At program point L148(lines 144 514) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse1 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse2 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1))) [2022-07-11 23:45:49,056 INFO L902 garLoopResultBuilder]: At program point L545(lines 107 546) the Hoare annotation is: true [2022-07-11 23:45:49,057 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2022-07-11 23:45:49,057 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 251) no Hoare annotation was computed. [2022-07-11 23:45:49,057 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 281 285) no Hoare annotation was computed. [2022-07-11 23:45:49,057 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 318) no Hoare annotation was computed. [2022-07-11 23:45:49,057 INFO L895 garLoopResultBuilder]: At program point L216(lines 114 524) the Hoare annotation is: (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0) [2022-07-11 23:45:49,057 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 501) no Hoare annotation was computed. [2022-07-11 23:45:49,057 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 512) no Hoare annotation was computed. [2022-07-11 23:45:49,057 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 523) no Hoare annotation was computed. [2022-07-11 23:45:49,057 INFO L895 garLoopResultBuilder]: At program point L184(lines 180 502) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse2 (<= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 .cse2) (and .cse0 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse1 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)))) [2022-07-11 23:45:49,058 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-11 23:45:49,058 INFO L899 garLoopResultBuilder]: For program point L483(lines 483 485) no Hoare annotation was computed. [2022-07-11 23:45:49,058 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 461) no Hoare annotation was computed. [2022-07-11 23:45:49,058 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 431) no Hoare annotation was computed. [2022-07-11 23:45:49,058 INFO L899 garLoopResultBuilder]: For program point L417-1(lines 417 431) no Hoare annotation was computed. [2022-07-11 23:45:49,058 INFO L899 garLoopResultBuilder]: For program point L450-2(lines 450 461) no Hoare annotation was computed. [2022-07-11 23:45:49,058 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 500) no Hoare annotation was computed. [2022-07-11 23:45:49,058 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 511) no Hoare annotation was computed. [2022-07-11 23:45:49,058 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 522) no Hoare annotation was computed. [2022-07-11 23:45:49,058 INFO L899 garLoopResultBuilder]: For program point L550(lines 550 552) no Hoare annotation was computed. [2022-07-11 23:45:49,059 INFO L899 garLoopResultBuilder]: For program point L550-2(lines 550 552) no Hoare annotation was computed. [2022-07-11 23:45:49,059 INFO L895 garLoopResultBuilder]: At program point L154(lines 150 512) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse1 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse2 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1))) [2022-07-11 23:45:49,059 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 355) no Hoare annotation was computed. [2022-07-11 23:45:49,059 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 223) no Hoare annotation was computed. [2022-07-11 23:45:49,059 INFO L899 garLoopResultBuilder]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2022-07-11 23:45:49,059 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 389) no Hoare annotation was computed. [2022-07-11 23:45:49,059 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 499) no Hoare annotation was computed. [2022-07-11 23:45:49,059 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 510) no Hoare annotation was computed. [2022-07-11 23:45:49,059 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 521) no Hoare annotation was computed. [2022-07-11 23:45:49,060 INFO L899 garLoopResultBuilder]: For program point L421(lines 421 427) no Hoare annotation was computed. [2022-07-11 23:45:49,060 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-11 23:45:49,060 INFO L895 garLoopResultBuilder]: At program point L190(lines 186 500) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse1 (<= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse0 .cse1) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)))) [2022-07-11 23:45:49,060 INFO L899 garLoopResultBuilder]: For program point L455(lines 455 458) no Hoare annotation was computed. [2022-07-11 23:45:49,060 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 325) no Hoare annotation was computed. [2022-07-11 23:45:49,060 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 290 300) no Hoare annotation was computed. [2022-07-11 23:45:49,060 INFO L902 garLoopResultBuilder]: At program point L555(lines 22 557) the Hoare annotation is: true [2022-07-11 23:45:49,060 INFO L895 garLoopResultBuilder]: At program point L324(lines 86 556) the Hoare annotation is: false [2022-07-11 23:45:49,060 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 498) no Hoare annotation was computed. [2022-07-11 23:45:49,061 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 509) no Hoare annotation was computed. [2022-07-11 23:45:49,061 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 520) no Hoare annotation was computed. [2022-07-11 23:45:49,061 INFO L899 garLoopResultBuilder]: For program point L226(lines 226 229) no Hoare annotation was computed. [2022-07-11 23:45:49,061 INFO L895 garLoopResultBuilder]: At program point L160(lines 156 510) the Hoare annotation is: (let ((.cse1 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse3 (< 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4) .cse3) (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse1 .cse2 .cse3) (and .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0) .cse3) (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse2 .cse3))) [2022-07-11 23:45:49,061 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 100) no Hoare annotation was computed. [2022-07-11 23:45:49,061 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-11 23:45:49,061 INFO L895 garLoopResultBuilder]: At program point L491(lines 108 544) the Hoare annotation is: (let ((.cse0 (= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse8 (= 4528 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse9 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse15 (= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse14 (= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse7 (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse5 (< 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse16 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse10 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse6 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse12 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse13 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse11 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3 .cse5) (and (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (and .cse1 .cse6 .cse7) (and .cse0 .cse1 .cse6) (and .cse1 .cse2 .cse8) (and .cse6 .cse8) (and .cse6 .cse4 .cse9) (and .cse10 .cse2 .cse7) (and .cse1 .cse10 .cse2 .cse4 .cse9 .cse11) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse6 .cse12 .cse13) (and .cse1 .cse2 (= 4480 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (and .cse1 .cse14 .cse2) (and .cse10 .cse6 .cse7) (and .cse1 .cse2 (= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (and .cse1 .cse10 .cse2 .cse3 .cse15) (and .cse1 .cse6 .cse15) (and .cse1 .cse2 .cse16 .cse3) (and .cse1 .cse10 .cse2 .cse12 .cse13 .cse11) (and .cse1 (= 4496 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2) (and .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse6 .cse4 .cse5) (and .cse1 .cse6 .cse16) (and .cse1 .cse10 .cse6 .cse12 .cse13 .cse11) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0))) [2022-07-11 23:45:49,061 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 328) no Hoare annotation was computed. [2022-07-11 23:45:49,062 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 262) no Hoare annotation was computed. [2022-07-11 23:45:49,062 INFO L899 garLoopResultBuilder]: For program point L260-2(lines 211 490) no Hoare annotation was computed. [2022-07-11 23:45:49,062 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 397) no Hoare annotation was computed. [2022-07-11 23:45:49,062 INFO L899 garLoopResultBuilder]: For program point L393-2(lines 211 490) no Hoare annotation was computed. [2022-07-11 23:45:49,062 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 296) no Hoare annotation was computed. [2022-07-11 23:45:49,062 INFO L899 garLoopResultBuilder]: For program point L294-2(lines 292 300) no Hoare annotation was computed. [2022-07-11 23:45:49,062 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 497) no Hoare annotation was computed. [2022-07-11 23:45:49,062 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 508) no Hoare annotation was computed. [2022-07-11 23:45:49,062 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 519) no Hoare annotation was computed. [2022-07-11 23:45:49,062 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 542) no Hoare annotation was computed. [2022-07-11 23:45:49,063 INFO L895 garLoopResultBuilder]: At program point L196(lines 192 498) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse1 (<= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse0 .cse1) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)))) [2022-07-11 23:45:49,063 INFO L895 garLoopResultBuilder]: At program point L130(lines 126 520) the Hoare annotation is: (and (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-07-11 23:45:49,063 INFO L899 garLoopResultBuilder]: For program point L97(lines 97 99) no Hoare annotation was computed. [2022-07-11 23:45:49,063 INFO L899 garLoopResultBuilder]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2022-07-11 23:45:49,063 INFO L899 garLoopResultBuilder]: For program point L527(lines 527 541) no Hoare annotation was computed. [2022-07-11 23:45:49,063 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 364) no Hoare annotation was computed. [2022-07-11 23:45:49,063 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-11 23:45:49,064 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 554) no Hoare annotation was computed. [2022-07-11 23:45:49,064 INFO L899 garLoopResultBuilder]: For program point L528(lines 528 533) no Hoare annotation was computed. [2022-07-11 23:45:49,064 INFO L899 garLoopResultBuilder]: For program point L528-2(lines 527 541) no Hoare annotation was computed. [2022-07-11 23:45:49,064 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 496) no Hoare annotation was computed. [2022-07-11 23:45:49,064 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 507) no Hoare annotation was computed. [2022-07-11 23:45:49,064 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 518) no Hoare annotation was computed. [2022-07-11 23:45:49,064 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 243) no Hoare annotation was computed. [2022-07-11 23:45:49,064 INFO L899 garLoopResultBuilder]: For program point L232-2(lines 211 490) no Hoare annotation was computed. [2022-07-11 23:45:49,064 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 532) no Hoare annotation was computed. [2022-07-11 23:45:49,067 INFO L356 BasicCegarLoop]: Path program histogram: [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] [2022-07-11 23:45:49,068 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:45:49,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:45:49 BoogieIcfgContainer [2022-07-11 23:45:49,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:45:49,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:45:49,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:45:49,096 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:45:49,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:45:34" (3/4) ... [2022-07-11 23:45:49,098 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-11 23:45:49,108 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-11 23:45:49,110 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-11 23:45:49,111 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-11 23:45:49,111 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-11 23:45:49,167 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:45:49,167 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:45:49,167 INFO L158 Benchmark]: Toolchain (without parser) took 15724.28ms. Allocated memory was 102.8MB in the beginning and 608.2MB in the end (delta: 505.4MB). Free memory was 74.3MB in the beginning and 415.2MB in the end (delta: -341.0MB). Peak memory consumption was 163.8MB. Max. memory is 16.1GB. [2022-07-11 23:45:49,167 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 59.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:45:49,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.37ms. Allocated memory was 102.8MB in the beginning and 153.1MB in the end (delta: 50.3MB). Free memory was 73.9MB in the beginning and 124.2MB in the end (delta: -50.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:45:49,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.89ms. Allocated memory is still 153.1MB. Free memory was 124.2MB in the beginning and 121.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-11 23:45:49,169 INFO L158 Benchmark]: Boogie Preprocessor took 36.97ms. Allocated memory is still 153.1MB. Free memory was 121.2MB in the beginning and 119.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:45:49,169 INFO L158 Benchmark]: RCFGBuilder took 524.97ms. Allocated memory is still 153.1MB. Free memory was 119.7MB in the beginning and 89.1MB in the end (delta: 30.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-07-11 23:45:49,169 INFO L158 Benchmark]: TraceAbstraction took 14722.01ms. Allocated memory was 153.1MB in the beginning and 608.2MB in the end (delta: 455.1MB). Free memory was 88.5MB in the beginning and 422.6MB in the end (delta: -334.1MB). Peak memory consumption was 415.1MB. Max. memory is 16.1GB. [2022-07-11 23:45:49,170 INFO L158 Benchmark]: Witness Printer took 71.58ms. Allocated memory is still 608.2MB. Free memory was 422.6MB in the beginning and 415.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-11 23:45:49,171 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.18ms. Allocated memory is still 102.8MB. Free memory is still 59.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.37ms. Allocated memory was 102.8MB in the beginning and 153.1MB in the end (delta: 50.3MB). Free memory was 73.9MB in the beginning and 124.2MB in the end (delta: -50.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.89ms. Allocated memory is still 153.1MB. Free memory was 124.2MB in the beginning and 121.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.97ms. Allocated memory is still 153.1MB. Free memory was 121.2MB in the beginning and 119.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 524.97ms. Allocated memory is still 153.1MB. Free memory was 119.7MB in the beginning and 89.1MB in the end (delta: 30.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14722.01ms. Allocated memory was 153.1MB in the beginning and 608.2MB in the end (delta: 455.1MB). Free memory was 88.5MB in the beginning and 422.6MB in the end (delta: -334.1MB). Peak memory consumption was 415.1MB. Max. memory is 16.1GB. * Witness Printer took 71.58ms. Allocated memory is still 608.2MB. Free memory was 422.6MB in the beginning and 415.2MB 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: 554]: 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, 127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 26, TraceHistogramMax: 18, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2107 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2107 mSDsluCounter, 8722 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3473 mSDsCounter, 562 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3061 IncrementalHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 562 mSolverCounterUnsat, 5249 mSDtfsCounter, 3061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2978 GetRequests, 2932 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14417occurred in iteration=24, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 5774 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 402 NumberOfFragments, 835 HoareAnnotationTreeSize, 22 FomulaSimplifications, 16222 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 22 FomulaSimplificationsInter, 13657 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 7041 NumberOfCodeBlocks, 7041 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8115 ConstructedInterpolants, 0 QuantifiedInterpolants, 12004 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3280 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 27797/27918 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: 198]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && s__state <= 4560) && 4560 <= s__state) || ((s__state < 12292 && 4560 <= s__state) && blastFlag == 0)) || ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state < 12292) && 4560 <= s__state) && blastFlag <= 4)) || (((s__hit == 0 && 2 == blastFlag) && s__state < 12292) && 4560 <= s__state)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4560 <= s__state) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: 4560 <= s__state && blastFlag == 0 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((4432 == s__state && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && blastFlag <= 4) || ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && blastFlag <= 4) && 4432 < s__state)) || (4384 == s__state && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 3 == s__state)) || ((4432 == s__state && s__hit == 0) && 2 == blastFlag)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && 4528 == s__state)) || (2 == blastFlag && 4528 == s__state)) || ((2 == blastFlag && s__state <= 4560) && 4560 <= s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && 256 == s__s3__tmp__new_cipher__algorithms) && 3 == s__state)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && 4352 <= s__state)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && 4480 == s__state)) || ((s__hit == 0 && 4512 == s__state) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__s3__tmp__next_state___0 <= 4560 && 2 == blastFlag) && 3 == s__state)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 == s__state)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && blastFlag <= 4) && 4400 == s__state)) || ((s__hit == 0 && 2 == blastFlag) && 4400 == s__state)) || (((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && 4416 == s__state) && blastFlag <= 4)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || ((s__hit == 0 && 4496 == s__state) && 256 == s__s3__tmp__new_cipher__algorithms)) || (4512 == s__state && 2 == blastFlag)) || (((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && blastFlag <= 4) && 3 == s__state)) || (((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4432 < s__state)) || ((s__hit == 0 && 2 == blastFlag) && 4416 == s__state)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 2 == blastFlag) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || blastFlag == 0 - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: blastFlag == 0 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && blastFlag <= 4) && 4432 < s__state) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4432 < s__state)) || ((s__state <= 4560 && blastFlag == 0) && 4432 < s__state)) || (((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4432 < s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && 4352 <= s__state) && blastFlag == 0) || ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4352 <= s__state) && blastFlag <= 4)) || (((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4352 <= s__state) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4464 <= s__state) || (((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4464 <= s__state)) || ((s__state <= 4560 && 4464 <= s__state) && blastFlag == 0) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && 4352 <= s__state) || ((s__state <= 4352 && 4352 <= s__state) && blastFlag == 0)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 2 == blastFlag) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (!(4400 <= s__state) && 4352 <= s__state) && blastFlag == 0 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4464 <= s__state) || ((2 == blastFlag && s__state <= 4560) && 4464 <= s__state)) || ((s__state <= 4560 && 4464 <= s__state) && blastFlag == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4464 <= s__state) || (((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4464 <= s__state)) || ((s__state <= 4560 && 4464 <= s__state) && blastFlag == 0) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && 4352 <= s__state) && blastFlag == 0) || ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4352 <= s__state) && blastFlag <= 4)) || (((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4352 <= s__state) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4464 <= s__state) || ((2 == blastFlag && s__state <= 4560) && 4464 <= s__state)) || ((s__state <= 4560 && 4464 <= s__state) && blastFlag == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((!(4400 <= s__state) && 4352 <= s__state) && blastFlag == 0) || ((!(4400 <= s__state) && blastFlag == 1) && 4352 <= s__state) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4352 <= s__state) && blastFlag <= 4) || ((s__state <= 4560 && 4352 <= s__state) && blastFlag == 0)) || (((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4352 <= s__state) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4464 <= s__state) || (((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4464 <= s__state)) || ((s__state <= 4560 && 4464 <= s__state) && blastFlag == 0) RESULT: Ultimate proved your program to be correct! [2022-07-11 23:45:49,216 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