./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/ntdrivers-simplified/kbfiltr_simpl2.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 bf75d7f1708750397c6bdac14ac08b964b10a95dcecc15b57a02c9969977c6ec --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 22:30:41,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:30:41,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:30:41,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:30:41,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:30:41,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:30:41,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:30:41,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:30:41,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:30:41,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:30:41,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:30:41,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:30:41,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:30:41,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:30:41,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:30:41,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:30:41,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:30:42,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:30:42,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:30:42,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:30:42,007 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:30:42,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:30:42,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:30:42,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:30:42,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:30:42,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:30:42,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:30:42,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:30:42,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:30:42,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:30:42,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:30:42,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:30:42,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:30:42,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:30:42,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:30:42,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:30:42,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:30:42,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:30:42,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:30:42,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:30:42,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:30:42,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:30:42,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:30:42,052 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:30:42,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:30:42,053 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:30:42,053 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:30:42,054 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:30:42,054 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:30:42,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:30:42,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:30:42,055 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:30:42,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:30:42,056 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:30:42,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:30:42,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:30:42,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:30:42,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:30:42,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:30:42,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:30:42,064 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:30:42,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:30:42,064 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:30:42,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:30:42,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:30:42,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:30:42,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:30:42,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:30:42,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:30:42,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:30:42,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:30:42,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:30:42,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:30:42,066 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:30:42,066 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:30:42,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:30:42,066 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 -> bf75d7f1708750397c6bdac14ac08b964b10a95dcecc15b57a02c9969977c6ec [2022-07-20 22:30:42,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:30:42,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:30:42,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:30:42,342 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:30:42,342 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:30:42,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-07-20 22:30:42,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60f4c1cb/deaaf26b6e9f4655aef9f54fe43ca3b4/FLAG0b868bfac [2022-07-20 22:30:42,753 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:30:42,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-07-20 22:30:42,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60f4c1cb/deaaf26b6e9f4655aef9f54fe43ca3b4/FLAG0b868bfac [2022-07-20 22:30:42,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60f4c1cb/deaaf26b6e9f4655aef9f54fe43ca3b4 [2022-07-20 22:30:42,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:30:42,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:30:42,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:30:42,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:30:42,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:30:42,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:30:42" (1/1) ... [2022-07-20 22:30:42,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7505b820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:42, skipping insertion in model container [2022-07-20 22:30:42,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:30:42" (1/1) ... [2022-07-20 22:30:42,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:30:42,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:30:43,000 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/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-07-20 22:30:43,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:30:43,007 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:30:43,052 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/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-07-20 22:30:43,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:30:43,067 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:30:43,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:43 WrapperNode [2022-07-20 22:30:43,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:30:43,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:30:43,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:30:43,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:30:43,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:43" (1/1) ... [2022-07-20 22:30:43,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:43" (1/1) ... [2022-07-20 22:30:43,113 INFO L137 Inliner]: procedures = 29, calls = 43, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 662 [2022-07-20 22:30:43,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:30:43,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:30:43,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:30:43,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:30:43,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:43" (1/1) ... [2022-07-20 22:30:43,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:43" (1/1) ... [2022-07-20 22:30:43,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:43" (1/1) ... [2022-07-20 22:30:43,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:43" (1/1) ... [2022-07-20 22:30:43,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:43" (1/1) ... [2022-07-20 22:30:43,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:43" (1/1) ... [2022-07-20 22:30:43,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:43" (1/1) ... [2022-07-20 22:30:43,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:30:43,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:30:43,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:30:43,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:30:43,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:43" (1/1) ... [2022-07-20 22:30:43,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:30:43,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:30:43,183 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-20 22:30:43,203 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-20 22:30:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:30:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-20 22:30:43,213 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-20 22:30:43,213 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-20 22:30:43,213 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-20 22:30:43,213 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-20 22:30:43,213 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-20 22:30:43,214 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-20 22:30:43,214 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-20 22:30:43,214 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-20 22:30:43,214 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-20 22:30:43,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:30:43,215 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-20 22:30:43,215 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-20 22:30:43,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:30:43,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:30:43,215 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-20 22:30:43,215 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-20 22:30:43,313 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:30:43,314 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:30:43,400 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:30:43,419 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:30:43,421 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:30:43,424 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:30:43,426 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:30:43,753 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-07-20 22:30:43,753 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-07-20 22:30:43,754 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-07-20 22:30:43,754 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-07-20 22:30:43,754 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-07-20 22:30:43,754 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-07-20 22:30:43,754 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-20 22:30:43,754 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-20 22:30:43,754 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-07-20 22:30:43,754 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-07-20 22:30:43,772 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:30:43,795 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-20 22:30:43,795 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-20 22:30:43,800 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:30:43,809 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:30:43,809 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 22:30:43,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:30:43 BoogieIcfgContainer [2022-07-20 22:30:43,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:30:43,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:30:43,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:30:43,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:30:43,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:30:42" (1/3) ... [2022-07-20 22:30:43,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5515d77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:30:43, skipping insertion in model container [2022-07-20 22:30:43,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:30:43" (2/3) ... [2022-07-20 22:30:43,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5515d77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:30:43, skipping insertion in model container [2022-07-20 22:30:43,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:30:43" (3/3) ... [2022-07-20 22:30:43,816 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2022-07-20 22:30:43,828 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:30:43,828 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:30:43,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:30:43,870 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@69afe9b6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60ad3ea1 [2022-07-20 22:30:43,871 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:30:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 171 states have (on average 1.5964912280701755) internal successors, (273), 188 states have internal predecessors, (273), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-20 22:30:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 22:30:43,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:43,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:43,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash -809123790, now seen corresponding path program 1 times [2022-07-20 22:30:43,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:43,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32744402] [2022-07-20 22:30:43,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:43,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:44,035 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-20 22:30:44,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:44,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32744402] [2022-07-20 22:30:44,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32744402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:44,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:44,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:30:44,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32340833] [2022-07-20 22:30:44,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:44,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:30:44,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:44,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:30:44,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:30:44,064 INFO L87 Difference]: Start difference. First operand has 208 states, 171 states have (on average 1.5964912280701755) internal successors, (273), 188 states have internal predecessors, (273), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:30:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:44,136 INFO L93 Difference]: Finished difference Result 338 states and 529 transitions. [2022-07-20 22:30:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:30:44,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 22:30:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:44,148 INFO L225 Difference]: With dead ends: 338 [2022-07-20 22:30:44,150 INFO L226 Difference]: Without dead ends: 198 [2022-07-20 22:30:44,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:30:44,156 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 178 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:44,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 415 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:44,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-20 22:30:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-07-20 22:30:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 178 states have internal predecessors, (249), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-20 22:30:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2022-07-20 22:30:44,195 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 13 [2022-07-20 22:30:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:44,196 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2022-07-20 22:30:44,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:30:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2022-07-20 22:30:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 22:30:44,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:44,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:44,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:30:44,197 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:44,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:44,198 INFO L85 PathProgramCache]: Analyzing trace with hash 900719787, now seen corresponding path program 1 times [2022-07-20 22:30:44,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:44,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946576523] [2022-07-20 22:30:44,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:44,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:44,249 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-20 22:30:44,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:44,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946576523] [2022-07-20 22:30:44,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946576523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:44,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:44,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:30:44,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628931712] [2022-07-20 22:30:44,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:44,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:30:44,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:44,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:30:44,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:30:44,253 INFO L87 Difference]: Start difference. First operand 198 states and 292 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:30:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:44,344 INFO L93 Difference]: Finished difference Result 314 states and 449 transitions. [2022-07-20 22:30:44,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:30:44,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 22:30:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:44,346 INFO L225 Difference]: With dead ends: 314 [2022-07-20 22:30:44,346 INFO L226 Difference]: Without dead ends: 262 [2022-07-20 22:30:44,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-20 22:30:44,351 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 201 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:44,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 428 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-20 22:30:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 249. [2022-07-20 22:30:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 213 states have (on average 1.431924882629108) internal successors, (305), 215 states have internal predecessors, (305), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2022-07-20 22:30:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 357 transitions. [2022-07-20 22:30:44,390 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 357 transitions. Word has length 19 [2022-07-20 22:30:44,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:44,390 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 357 transitions. [2022-07-20 22:30:44,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:30:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 357 transitions. [2022-07-20 22:30:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 22:30:44,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:44,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:44,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 22:30:44,393 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043530, now seen corresponding path program 1 times [2022-07-20 22:30:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:44,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083006020] [2022-07-20 22:30:44,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:44,454 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-20 22:30:44,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:44,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083006020] [2022-07-20 22:30:44,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083006020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:44,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:44,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:30:44,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025903337] [2022-07-20 22:30:44,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:44,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:30:44,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:44,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:30:44,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:30:44,457 INFO L87 Difference]: Start difference. First operand 249 states and 357 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:30:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:44,478 INFO L93 Difference]: Finished difference Result 402 states and 557 transitions. [2022-07-20 22:30:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:30:44,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 22:30:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:44,481 INFO L225 Difference]: With dead ends: 402 [2022-07-20 22:30:44,481 INFO L226 Difference]: Without dead ends: 306 [2022-07-20 22:30:44,483 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-20 22:30:44,487 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 238 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:44,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 352 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-20 22:30:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 287. [2022-07-20 22:30:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 253 states have (on average 1.4189723320158103) internal successors, (359), 253 states have internal predecessors, (359), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-20 22:30:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 406 transitions. [2022-07-20 22:30:44,516 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 406 transitions. Word has length 18 [2022-07-20 22:30:44,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:44,517 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 406 transitions. [2022-07-20 22:30:44,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:30:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 406 transitions. [2022-07-20 22:30:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 22:30:44,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:44,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:44,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 22:30:44,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:44,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2086831099, now seen corresponding path program 1 times [2022-07-20 22:30:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:44,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942828759] [2022-07-20 22:30:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:44,595 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-20 22:30:44,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:44,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942828759] [2022-07-20 22:30:44,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942828759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:44,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:44,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:30:44,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63613622] [2022-07-20 22:30:44,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:44,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:30:44,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:44,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:30:44,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:30:44,598 INFO L87 Difference]: Start difference. First operand 287 states and 406 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:30:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:44,651 INFO L93 Difference]: Finished difference Result 290 states and 408 transitions. [2022-07-20 22:30:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:30:44,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 22:30:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:44,654 INFO L225 Difference]: With dead ends: 290 [2022-07-20 22:30:44,654 INFO L226 Difference]: Without dead ends: 286 [2022-07-20 22:30:44,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:30:44,660 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 25 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:44,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 469 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-20 22:30:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-07-20 22:30:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 253 states have (on average 1.4110671936758894) internal successors, (357), 252 states have internal predecessors, (357), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-20 22:30:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 403 transitions. [2022-07-20 22:30:44,677 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 403 transitions. Word has length 29 [2022-07-20 22:30:44,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:44,677 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 403 transitions. [2022-07-20 22:30:44,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:30:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 403 transitions. [2022-07-20 22:30:44,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 22:30:44,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:44,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:44,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 22:30:44,680 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash -507734156, now seen corresponding path program 1 times [2022-07-20 22:30:44,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:44,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033791177] [2022-07-20 22:30:44,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:44,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:44,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:44,791 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-20 22:30:44,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:44,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033791177] [2022-07-20 22:30:44,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033791177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:44,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:44,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 22:30:44,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021424251] [2022-07-20 22:30:44,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:44,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 22:30:44,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:44,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 22:30:44,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:30:44,793 INFO L87 Difference]: Start difference. First operand 286 states and 403 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 22:30:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:44,924 INFO L93 Difference]: Finished difference Result 308 states and 427 transitions. [2022-07-20 22:30:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:30:44,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-20 22:30:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:44,927 INFO L225 Difference]: With dead ends: 308 [2022-07-20 22:30:44,927 INFO L226 Difference]: Without dead ends: 303 [2022-07-20 22:30:44,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:30:44,928 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 331 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:44,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 624 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-20 22:30:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2022-07-20 22:30:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 263 states have (on average 1.403041825095057) internal successors, (369), 261 states have internal predecessors, (369), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-20 22:30:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 415 transitions. [2022-07-20 22:30:44,946 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 415 transitions. Word has length 33 [2022-07-20 22:30:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:44,947 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 415 transitions. [2022-07-20 22:30:44,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 22:30:44,947 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 415 transitions. [2022-07-20 22:30:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 22:30:44,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:44,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:44,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 22:30:44,949 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:44,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:44,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1061247362, now seen corresponding path program 1 times [2022-07-20 22:30:44,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:44,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844243662] [2022-07-20 22:30:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:44,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,036 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-20 22:30:45,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:45,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844243662] [2022-07-20 22:30:45,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844243662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:45,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:45,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 22:30:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009421110] [2022-07-20 22:30:45,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:45,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 22:30:45,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:45,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 22:30:45,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:30:45,039 INFO L87 Difference]: Start difference. First operand 296 states and 415 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 22:30:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:45,163 INFO L93 Difference]: Finished difference Result 308 states and 426 transitions. [2022-07-20 22:30:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:30:45,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-20 22:30:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:45,165 INFO L225 Difference]: With dead ends: 308 [2022-07-20 22:30:45,165 INFO L226 Difference]: Without dead ends: 303 [2022-07-20 22:30:45,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:30:45,166 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 327 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:45,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 625 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-20 22:30:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2022-07-20 22:30:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 264 states have (on average 1.4015151515151516) internal successors, (370), 262 states have internal predecessors, (370), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-20 22:30:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 416 transitions. [2022-07-20 22:30:45,176 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 416 transitions. Word has length 34 [2022-07-20 22:30:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:45,177 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 416 transitions. [2022-07-20 22:30:45,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 22:30:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 416 transitions. [2022-07-20 22:30:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 22:30:45,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:45,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:45,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 22:30:45,178 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1403318816, now seen corresponding path program 1 times [2022-07-20 22:30:45,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:45,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802236043] [2022-07-20 22:30:45,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:45,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,209 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-20 22:30:45,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:45,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802236043] [2022-07-20 22:30:45,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802236043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:45,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:45,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:30:45,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690443866] [2022-07-20 22:30:45,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:45,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:30:45,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:45,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:30:45,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:30:45,211 INFO L87 Difference]: Start difference. First operand 297 states and 416 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 22:30:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:45,321 INFO L93 Difference]: Finished difference Result 336 states and 455 transitions. [2022-07-20 22:30:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:30:45,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-20 22:30:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:45,323 INFO L225 Difference]: With dead ends: 336 [2022-07-20 22:30:45,323 INFO L226 Difference]: Without dead ends: 278 [2022-07-20 22:30:45,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:30:45,324 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 313 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:45,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 731 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-20 22:30:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 264. [2022-07-20 22:30:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 233 states have (on average 1.390557939914163) internal successors, (324), 231 states have internal predecessors, (324), 18 states have call successors, (18), 10 states have call predecessors, (18), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-20 22:30:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 365 transitions. [2022-07-20 22:30:45,334 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 365 transitions. Word has length 34 [2022-07-20 22:30:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:45,334 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 365 transitions. [2022-07-20 22:30:45,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 22:30:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 365 transitions. [2022-07-20 22:30:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 22:30:45,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:45,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:45,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 22:30:45,336 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:45,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:45,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817110, now seen corresponding path program 1 times [2022-07-20 22:30:45,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:45,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052963931] [2022-07-20 22:30:45,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:45,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,357 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-20 22:30:45,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:45,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052963931] [2022-07-20 22:30:45,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052963931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:45,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:45,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:30:45,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439545443] [2022-07-20 22:30:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:45,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:30:45,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:45,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:30:45,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:30:45,360 INFO L87 Difference]: Start difference. First operand 264 states and 365 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:30:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:45,437 INFO L93 Difference]: Finished difference Result 317 states and 429 transitions. [2022-07-20 22:30:45,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:30:45,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 22:30:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:45,439 INFO L225 Difference]: With dead ends: 317 [2022-07-20 22:30:45,439 INFO L226 Difference]: Without dead ends: 282 [2022-07-20 22:30:45,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:30:45,440 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 289 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:45,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 421 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-20 22:30:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 264. [2022-07-20 22:30:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 233 states have (on average 1.3819742489270386) internal successors, (322), 231 states have internal predecessors, (322), 18 states have call successors, (18), 10 states have call predecessors, (18), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-20 22:30:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 363 transitions. [2022-07-20 22:30:45,452 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 363 transitions. Word has length 34 [2022-07-20 22:30:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:45,453 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 363 transitions. [2022-07-20 22:30:45,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:30:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 363 transitions. [2022-07-20 22:30:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 22:30:45,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:45,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:45,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 22:30:45,454 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1671852310, now seen corresponding path program 1 times [2022-07-20 22:30:45,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:45,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689945266] [2022-07-20 22:30:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:45,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,502 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-20 22:30:45,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:45,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689945266] [2022-07-20 22:30:45,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689945266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:45,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:45,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:30:45,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619657185] [2022-07-20 22:30:45,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:45,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:30:45,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:45,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:30:45,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:30:45,505 INFO L87 Difference]: Start difference. First operand 264 states and 363 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 22:30:45,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:45,569 INFO L93 Difference]: Finished difference Result 278 states and 380 transitions. [2022-07-20 22:30:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:30:45,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-20 22:30:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:45,570 INFO L225 Difference]: With dead ends: 278 [2022-07-20 22:30:45,570 INFO L226 Difference]: Without dead ends: 82 [2022-07-20 22:30:45,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:30:45,572 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 285 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:45,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 421 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:45,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-20 22:30:45,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-20 22:30:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 72 states have internal predecessors, (87), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 22:30:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2022-07-20 22:30:45,578 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 35 [2022-07-20 22:30:45,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:45,578 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2022-07-20 22:30:45,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 22:30:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2022-07-20 22:30:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 22:30:45,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:45,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:45,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 22:30:45,580 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:45,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:45,581 INFO L85 PathProgramCache]: Analyzing trace with hash 965976384, now seen corresponding path program 1 times [2022-07-20 22:30:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:45,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029988852] [2022-07-20 22:30:45,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:45,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 22:30:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 22:30:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,627 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-20 22:30:45,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:45,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029988852] [2022-07-20 22:30:45,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029988852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:45,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:45,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:30:45,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141078042] [2022-07-20 22:30:45,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:45,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:30:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:45,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:30:45,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:30:45,630 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 22:30:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:45,673 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-07-20 22:30:45,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:30:45,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-07-20 22:30:45,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:45,674 INFO L225 Difference]: With dead ends: 106 [2022-07-20 22:30:45,674 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 22:30:45,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:30:45,675 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:45,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 222 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 22:30:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-20 22:30:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 70 states have internal predecessors, (84), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 22:30:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2022-07-20 22:30:45,679 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 39 [2022-07-20 22:30:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:45,679 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2022-07-20 22:30:45,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 22:30:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-07-20 22:30:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 22:30:45,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:45,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:45,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 22:30:45,680 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:45,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:45,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1309646071, now seen corresponding path program 1 times [2022-07-20 22:30:45,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:45,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553734816] [2022-07-20 22:30:45,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:45,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,727 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-20 22:30:45,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:45,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553734816] [2022-07-20 22:30:45,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553734816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:45,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:45,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 22:30:45,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809129093] [2022-07-20 22:30:45,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:45,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 22:30:45,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:45,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 22:30:45,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 22:30:45,729 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 22:30:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:45,796 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2022-07-20 22:30:45,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 22:30:45,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-07-20 22:30:45,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:45,797 INFO L225 Difference]: With dead ends: 126 [2022-07-20 22:30:45,797 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 22:30:45,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:30:45,798 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:45,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 395 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 22:30:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2022-07-20 22:30:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 74 states have internal predecessors, (88), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 22:30:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-07-20 22:30:45,802 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 41 [2022-07-20 22:30:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:45,802 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-07-20 22:30:45,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 22:30:45,803 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-07-20 22:30:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 22:30:45,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:45,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:45,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 22:30:45,804 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:45,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1579777203, now seen corresponding path program 1 times [2022-07-20 22:30:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:45,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996448607] [2022-07-20 22:30:45,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,876 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-20 22:30:45,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:45,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996448607] [2022-07-20 22:30:45,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996448607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:45,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:45,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 22:30:45,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691084319] [2022-07-20 22:30:45,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:45,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 22:30:45,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:45,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 22:30:45,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 22:30:45,878 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 22:30:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:45,938 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-07-20 22:30:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 22:30:45,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-20 22:30:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:45,939 INFO L225 Difference]: With dead ends: 96 [2022-07-20 22:30:45,939 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 22:30:45,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-20 22:30:45,940 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:45,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 387 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 22:30:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-07-20 22:30:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 75 states have internal predecessors, (89), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 22:30:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2022-07-20 22:30:45,944 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 43 [2022-07-20 22:30:45,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:45,945 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2022-07-20 22:30:45,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 22:30:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2022-07-20 22:30:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 22:30:45,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:45,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:45,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 22:30:45,947 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1941659704, now seen corresponding path program 1 times [2022-07-20 22:30:45,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:45,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992389641] [2022-07-20 22:30:45,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:45,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:45,987 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-20 22:30:45,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:45,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992389641] [2022-07-20 22:30:45,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992389641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:45,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:45,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:30:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147532081] [2022-07-20 22:30:45,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:45,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:30:45,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:45,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:30:45,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:30:45,989 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 22:30:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:46,024 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2022-07-20 22:30:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:30:46,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-07-20 22:30:46,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:46,025 INFO L225 Difference]: With dead ends: 102 [2022-07-20 22:30:46,025 INFO L226 Difference]: Without dead ends: 97 [2022-07-20 22:30:46,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:30:46,026 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 28 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:46,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 183 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-20 22:30:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2022-07-20 22:30:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 22:30:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2022-07-20 22:30:46,031 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 42 [2022-07-20 22:30:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:46,031 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2022-07-20 22:30:46,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 22:30:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2022-07-20 22:30:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 22:30:46,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:46,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:46,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 22:30:46,032 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:46,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:46,033 INFO L85 PathProgramCache]: Analyzing trace with hash 598103956, now seen corresponding path program 1 times [2022-07-20 22:30:46,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:46,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299320845] [2022-07-20 22:30:46,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:46,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,069 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-20 22:30:46,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:46,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299320845] [2022-07-20 22:30:46,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299320845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:46,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:46,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:30:46,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350448184] [2022-07-20 22:30:46,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:46,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:30:46,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:46,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:30:46,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:30:46,071 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 22:30:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:46,120 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2022-07-20 22:30:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:30:46,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-20 22:30:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:46,121 INFO L225 Difference]: With dead ends: 174 [2022-07-20 22:30:46,121 INFO L226 Difference]: Without dead ends: 167 [2022-07-20 22:30:46,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:30:46,122 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 54 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:46,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 230 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-20 22:30:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2022-07-20 22:30:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 137 states have (on average 1.1897810218978102) internal successors, (163), 139 states have internal predecessors, (163), 9 states have call successors, (9), 8 states have call predecessors, (9), 10 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-20 22:30:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2022-07-20 22:30:46,131 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 44 [2022-07-20 22:30:46,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:46,132 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2022-07-20 22:30:46,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 22:30:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2022-07-20 22:30:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 22:30:46,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:46,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:46,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 22:30:46,133 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:46,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:46,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1921855978, now seen corresponding path program 1 times [2022-07-20 22:30:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:46,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484934088] [2022-07-20 22:30:46,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,193 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-20 22:30:46,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:46,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484934088] [2022-07-20 22:30:46,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484934088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:46,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:46,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 22:30:46,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326686031] [2022-07-20 22:30:46,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:46,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 22:30:46,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 22:30:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:30:46,196 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 22:30:46,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:46,245 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2022-07-20 22:30:46,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:30:46,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-07-20 22:30:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:46,246 INFO L225 Difference]: With dead ends: 217 [2022-07-20 22:30:46,247 INFO L226 Difference]: Without dead ends: 145 [2022-07-20 22:30:46,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:30:46,248 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:46,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 332 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-20 22:30:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-07-20 22:30:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.16) internal successors, (145), 127 states have internal predecessors, (145), 9 states have call successors, (9), 8 states have call predecessors, (9), 10 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-20 22:30:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2022-07-20 22:30:46,257 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 44 [2022-07-20 22:30:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:46,257 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2022-07-20 22:30:46,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 22:30:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2022-07-20 22:30:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 22:30:46,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:46,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:30:46,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 22:30:46,258 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:46,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash -944983075, now seen corresponding path program 1 times [2022-07-20 22:30:46,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:46,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690799376] [2022-07-20 22:30:46,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:46,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:30:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,325 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-20 22:30:46,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:46,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690799376] [2022-07-20 22:30:46,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690799376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:46,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:46,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 22:30:46,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973437592] [2022-07-20 22:30:46,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:46,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 22:30:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:46,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 22:30:46,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:30:46,327 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 22:30:46,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:46,422 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2022-07-20 22:30:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 22:30:46,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-07-20 22:30:46,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:46,423 INFO L225 Difference]: With dead ends: 189 [2022-07-20 22:30:46,423 INFO L226 Difference]: Without dead ends: 129 [2022-07-20 22:30:46,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:30:46,424 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 81 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:46,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 267 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-20 22:30:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-20 22:30:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.1441441441441442) internal successors, (127), 113 states have internal predecessors, (127), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-20 22:30:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2022-07-20 22:30:46,430 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 48 [2022-07-20 22:30:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:46,431 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2022-07-20 22:30:46,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 22:30:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2022-07-20 22:30:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 22:30:46,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:46,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:30:46,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 22:30:46,432 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:46,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:46,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1127576207, now seen corresponding path program 1 times [2022-07-20 22:30:46,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:46,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965189800] [2022-07-20 22:30:46,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:46,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:30:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,479 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-20 22:30:46,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:46,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965189800] [2022-07-20 22:30:46,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965189800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:46,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:46,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 22:30:46,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501190794] [2022-07-20 22:30:46,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:46,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 22:30:46,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:46,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 22:30:46,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:30:46,481 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 22:30:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:46,522 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2022-07-20 22:30:46,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:30:46,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2022-07-20 22:30:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:46,524 INFO L225 Difference]: With dead ends: 185 [2022-07-20 22:30:46,524 INFO L226 Difference]: Without dead ends: 141 [2022-07-20 22:30:46,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:30:46,524 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:46,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 241 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:46,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-20 22:30:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2022-07-20 22:30:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 119 states have internal predecessors, (133), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-20 22:30:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-07-20 22:30:46,533 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 49 [2022-07-20 22:30:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:46,533 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-07-20 22:30:46,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 22:30:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-07-20 22:30:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 22:30:46,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:46,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:30:46,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 22:30:46,534 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:46,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1385741645, now seen corresponding path program 1 times [2022-07-20 22:30:46,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:46,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329388054] [2022-07-20 22:30:46,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:46,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:30:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,606 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-20 22:30:46,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:46,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329388054] [2022-07-20 22:30:46,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329388054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:46,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:46,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 22:30:46,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021585630] [2022-07-20 22:30:46,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:46,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 22:30:46,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:46,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 22:30:46,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 22:30:46,608 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 22:30:46,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:46,684 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-07-20 22:30:46,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:30:46,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-07-20 22:30:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:46,686 INFO L225 Difference]: With dead ends: 138 [2022-07-20 22:30:46,686 INFO L226 Difference]: Without dead ends: 115 [2022-07-20 22:30:46,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-20 22:30:46,686 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 116 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:46,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 159 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-20 22:30:46,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-07-20 22:30:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.121212121212121) internal successors, (111), 100 states have internal predecessors, (111), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 22:30:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2022-07-20 22:30:46,694 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 49 [2022-07-20 22:30:46,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:46,694 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2022-07-20 22:30:46,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 22:30:46,695 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2022-07-20 22:30:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 22:30:46,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:46,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:30:46,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 22:30:46,695 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:46,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1173355825, now seen corresponding path program 1 times [2022-07-20 22:30:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:46,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065236877] [2022-07-20 22:30:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:30:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,741 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-20 22:30:46,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:46,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065236877] [2022-07-20 22:30:46,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065236877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:46,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:46,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 22:30:46,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812945290] [2022-07-20 22:30:46,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:46,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 22:30:46,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 22:30:46,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:30:46,744 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 22:30:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:46,794 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-07-20 22:30:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:30:46,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-07-20 22:30:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:46,795 INFO L225 Difference]: With dead ends: 136 [2022-07-20 22:30:46,795 INFO L226 Difference]: Without dead ends: 108 [2022-07-20 22:30:46,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:30:46,797 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:46,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:46,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-20 22:30:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-20 22:30:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.086021505376344) internal successors, (101), 93 states have internal predecessors, (101), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 22:30:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2022-07-20 22:30:46,802 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 49 [2022-07-20 22:30:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:46,802 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2022-07-20 22:30:46,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 22:30:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2022-07-20 22:30:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 22:30:46,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:46,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:30:46,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 22:30:46,803 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:46,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:46,806 INFO L85 PathProgramCache]: Analyzing trace with hash -370766040, now seen corresponding path program 1 times [2022-07-20 22:30:46,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:46,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875550757] [2022-07-20 22:30:46,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:46,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:30:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,857 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-20 22:30:46,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:46,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875550757] [2022-07-20 22:30:46,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875550757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:46,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:46,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 22:30:46,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261164839] [2022-07-20 22:30:46,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:46,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 22:30:46,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:46,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 22:30:46,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:30:46,859 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 22:30:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:46,920 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-07-20 22:30:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:30:46,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-20 22:30:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:46,921 INFO L225 Difference]: With dead ends: 115 [2022-07-20 22:30:46,921 INFO L226 Difference]: Without dead ends: 108 [2022-07-20 22:30:46,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 22:30:46,922 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:46,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 287 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-20 22:30:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-20 22:30:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.064516129032258) internal successors, (99), 93 states have internal predecessors, (99), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 22:30:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2022-07-20 22:30:46,938 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 50 [2022-07-20 22:30:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:46,938 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2022-07-20 22:30:46,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 22:30:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-07-20 22:30:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 22:30:46,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:46,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:30:46,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 22:30:46,939 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1197751707, now seen corresponding path program 1 times [2022-07-20 22:30:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:46,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733533720] [2022-07-20 22:30:46,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:46,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:46,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:47,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:30:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:47,016 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-20 22:30:47,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:47,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733533720] [2022-07-20 22:30:47,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733533720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:47,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:47,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 22:30:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457613648] [2022-07-20 22:30:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:47,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 22:30:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:47,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 22:30:47,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:30:47,018 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 22:30:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:47,087 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-07-20 22:30:47,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:30:47,087 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-07-20 22:30:47,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:47,088 INFO L225 Difference]: With dead ends: 119 [2022-07-20 22:30:47,088 INFO L226 Difference]: Without dead ends: 108 [2022-07-20 22:30:47,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 22:30:47,089 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:47,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 287 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:30:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-20 22:30:47,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-20 22:30:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.043010752688172) internal successors, (97), 93 states have internal predecessors, (97), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 22:30:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2022-07-20 22:30:47,095 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 51 [2022-07-20 22:30:47,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:47,095 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2022-07-20 22:30:47,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 22:30:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2022-07-20 22:30:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 22:30:47,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:30:47,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:30:47,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 22:30:47,096 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:30:47,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:30:47,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1206267035, now seen corresponding path program 1 times [2022-07-20 22:30:47,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:30:47,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481609937] [2022-07-20 22:30:47,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:30:47,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:30:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:47,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 22:30:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:47,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:30:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:47,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:30:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:30:47,132 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-20 22:30:47,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:30:47,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481609937] [2022-07-20 22:30:47,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481609937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:30:47,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:30:47,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 22:30:47,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591782755] [2022-07-20 22:30:47,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:30:47,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 22:30:47,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:30:47,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 22:30:47,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:30:47,134 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 22:30:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:30:47,158 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2022-07-20 22:30:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:30:47,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2022-07-20 22:30:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:30:47,160 INFO L225 Difference]: With dead ends: 108 [2022-07-20 22:30:47,160 INFO L226 Difference]: Without dead ends: 0 [2022-07-20 22:30:47,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:30:47,161 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:30:47,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 115 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:30:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-20 22:30:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-20 22:30:47,161 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-20 22:30:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-20 22:30:47,162 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2022-07-20 22:30:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:30:47,162 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-20 22:30:47,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 22:30:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-20 22:30:47,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-20 22:30:47,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 22:30:47,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 22:30:47,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-20 22:30:49,079 INFO L895 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 618 628) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~SKIP2~0 2) (= ~IPC~0 2) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1)) (= ~MPR3~0 1)) [2022-07-20 22:30:49,080 INFO L895 garLoopResultBuilder]: At program point L573(lines 568 575) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~setEventCalled~0 1) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~SKIP2~0 2) (= ~IPC~0 2) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1)) (= ~MPR3~0 1)) [2022-07-20 22:30:49,080 INFO L899 garLoopResultBuilder]: For program point KbFilter_CompleteFINAL(lines 618 628) no Hoare annotation was computed. [2022-07-20 22:30:49,080 INFO L899 garLoopResultBuilder]: For program point KbFilter_CompleteEXIT(lines 618 628) no Hoare annotation was computed. [2022-07-20 22:30:49,080 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 656) no Hoare annotation was computed. [2022-07-20 22:30:49,080 INFO L899 garLoopResultBuilder]: For program point KbFilter_CreateCloseEXIT(lines 629 664) no Hoare annotation was computed. [2022-07-20 22:30:49,080 INFO L895 garLoopResultBuilder]: At program point L653(lines 641 655) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~SKIP2~0 2) (= ~IPC~0 2) (not (= 2 ~DC~0))) [2022-07-20 22:30:49,080 INFO L895 garLoopResultBuilder]: At program point L645(lines 638 656) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~SKIP2~0 2) (= ~IPC~0 2) (not (= 2 ~DC~0))) [2022-07-20 22:30:49,081 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 655) no Hoare annotation was computed. [2022-07-20 22:30:49,081 INFO L895 garLoopResultBuilder]: At program point KbFilter_CreateCloseENTRY(lines 629 664) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~SKIP2~0 2) (= ~IPC~0 2) (not (= 2 ~DC~0))) [2022-07-20 22:30:49,081 INFO L895 garLoopResultBuilder]: At program point L660(line 660) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~SKIP2~0 2) (= ~IPC~0 2) (not (= 2 ~DC~0))) [2022-07-20 22:30:49,081 INFO L899 garLoopResultBuilder]: For program point L660-1(line 660) no Hoare annotation was computed. [2022-07-20 22:30:49,081 INFO L899 garLoopResultBuilder]: For program point KbFilter_CreateCloseFINAL(lines 629 664) no Hoare annotation was computed. [2022-07-20 22:30:49,081 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 654) no Hoare annotation was computed. [2022-07-20 22:30:49,081 INFO L899 garLoopResultBuilder]: For program point L562-1(lines 554 567) no Hoare annotation was computed. [2022-07-20 22:30:49,081 INFO L899 garLoopResultBuilder]: For program point L558(lines 558 564) no Hoare annotation was computed. [2022-07-20 22:30:49,082 INFO L895 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 554 567) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (= ~pended~0 1)) (.cse3 (= ~SKIP2~0 2)) (.cse4 (= ~IPC~0 2)) (.cse5 (not (= 2 ~DC~0))) (.cse6 (= ~s~0 |old(~s~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-07-20 22:30:49,082 INFO L899 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 554 567) no Hoare annotation was computed. [2022-07-20 22:30:49,082 INFO L895 garLoopResultBuilder]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (= ~pended~0 1)) (.cse3 (= ~SKIP2~0 2)) (.cse4 (= ~IPC~0 2)) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-07-20 22:30:49,082 INFO L902 garLoopResultBuilder]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2022-07-20 22:30:49,082 INFO L899 garLoopResultBuilder]: For program point errorFnFINAL(lines 1009 1016) no Hoare annotation was computed. [2022-07-20 22:30:49,082 INFO L899 garLoopResultBuilder]: For program point errorFnEXIT(lines 1009 1016) no Hoare annotation was computed. [2022-07-20 22:30:49,082 INFO L899 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2022-07-20 22:30:49,082 INFO L895 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: false [2022-07-20 22:30:49,083 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 459) no Hoare annotation was computed. [2022-07-20 22:30:49,083 INFO L899 garLoopResultBuilder]: For program point L168(lines 168 271) no Hoare annotation was computed. [2022-07-20 22:30:49,083 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 282) no Hoare annotation was computed. [2022-07-20 22:30:49,083 INFO L899 garLoopResultBuilder]: For program point L433(lines 433 439) no Hoare annotation was computed. [2022-07-20 22:30:49,083 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 984) no Hoare annotation was computed. [2022-07-20 22:30:49,083 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 817) no Hoare annotation was computed. [2022-07-20 22:30:49,083 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 436) no Hoare annotation was computed. [2022-07-20 22:30:49,083 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 409) no Hoare annotation was computed. [2022-07-20 22:30:49,084 INFO L895 garLoopResultBuilder]: At program point L269(lines 172 270) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= 2 ~DC~0)) (.cse2 (not (= ~pended~0 1))) (.cse3 (not (= ~IPC~0 2))) (.cse4 (not (= ~SKIP1~0 ~NP~0))) (.cse5 (= |ULTIMATE.start_main_~status~1#1| 0))) (or (and (= ~compRegistered~0 1) .cse0 .cse1 (= 2 ~s~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= ~compRegistered~0 0) .cse4 .cse5))) [2022-07-20 22:30:49,084 INFO L895 garLoopResultBuilder]: At program point L369(lines 368 409) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,084 INFO L895 garLoopResultBuilder]: At program point L171(lines 117 288) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,084 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 281) no Hoare annotation was computed. [2022-07-20 22:30:49,084 INFO L895 garLoopResultBuilder]: At program point L997(line 997) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,084 INFO L899 garLoopResultBuilder]: For program point L997-1(line 997) no Hoare annotation was computed. [2022-07-20 22:30:49,084 INFO L899 garLoopResultBuilder]: For program point L931(lines 931 974) no Hoare annotation was computed. [2022-07-20 22:30:49,084 INFO L899 garLoopResultBuilder]: For program point L700(lines 700 729) no Hoare annotation was computed. [2022-07-20 22:30:49,084 INFO L899 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2022-07-20 22:30:49,085 INFO L895 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: false [2022-07-20 22:30:49,085 INFO L895 garLoopResultBuilder]: At program point L701(lines 700 729) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,085 INFO L899 garLoopResultBuilder]: For program point L734-1(lines 730 736) no Hoare annotation was computed. [2022-07-20 22:30:49,085 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 245) no Hoare annotation was computed. [2022-07-20 22:30:49,085 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 615) no Hoare annotation was computed. [2022-07-20 22:30:49,085 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 342) no Hoare annotation was computed. [2022-07-20 22:30:49,085 INFO L899 garLoopResultBuilder]: For program point L339-2(lines 339 342) no Hoare annotation was computed. [2022-07-20 22:30:49,085 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-07-20 22:30:49,085 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 280) no Hoare annotation was computed. [2022-07-20 22:30:49,086 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 291) no Hoare annotation was computed. [2022-07-20 22:30:49,086 INFO L899 garLoopResultBuilder]: For program point L934(lines 934 973) no Hoare annotation was computed. [2022-07-20 22:30:49,086 INFO L899 garLoopResultBuilder]: For program point L769(lines 769 792) no Hoare annotation was computed. [2022-07-20 22:30:49,086 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 728) no Hoare annotation was computed. [2022-07-20 22:30:49,086 INFO L895 garLoopResultBuilder]: At program point L604(lines 603 615) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0)) [2022-07-20 22:30:49,086 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 408) no Hoare annotation was computed. [2022-07-20 22:30:49,086 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2022-07-20 22:30:49,086 INFO L895 garLoopResultBuilder]: At program point L109(lines 108 291) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= |ULTIMATE.start_KbFilter_PnP_~status~0#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,087 INFO L895 garLoopResultBuilder]: At program point L76(lines 57 78) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~s~0 ~NP~0)) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2022-07-20 22:30:49,087 INFO L895 garLoopResultBuilder]: At program point L935(lines 875 990) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,087 INFO L895 garLoopResultBuilder]: At program point L770(lines 769 792) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,087 INFO L895 garLoopResultBuilder]: At program point L374(lines 373 408) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,087 INFO L899 garLoopResultBuilder]: For program point L903(lines 903 982) no Hoare annotation was computed. [2022-07-20 22:30:49,087 INFO L895 garLoopResultBuilder]: At program point L606(lines 605 615) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0)) [2022-07-20 22:30:49,087 INFO L895 garLoopResultBuilder]: At program point L441(lines 432 459) the Hoare annotation is: (and (not (= ~pended~0 1)) (not (= ~SKIP1~0 ~NP~0)) (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= 2 ~DC~0)) (.cse2 (not (= ~IPC~0 2)))) (or (and .cse0 .cse1 .cse2 (<= ~compRegistered~0 0)) (and (= ~compRegistered~0 1) .cse0 .cse1 .cse2)))) [2022-07-20 22:30:49,088 INFO L895 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: false [2022-07-20 22:30:49,088 INFO L899 garLoopResultBuilder]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2022-07-20 22:30:49,088 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 189) no Hoare annotation was computed. [2022-07-20 22:30:49,088 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 279) no Hoare annotation was computed. [2022-07-20 22:30:49,088 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 290) no Hoare annotation was computed. [2022-07-20 22:30:49,088 INFO L895 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,088 INFO L899 garLoopResultBuilder]: For program point L1003-1(line 1003) no Hoare annotation was computed. [2022-07-20 22:30:49,088 INFO L899 garLoopResultBuilder]: For program point L706(lines 706 727) no Hoare annotation was computed. [2022-07-20 22:30:49,088 INFO L895 garLoopResultBuilder]: At program point L376(lines 375 408) the Hoare annotation is: (= |ULTIMATE.start_main_~status~1#1| 0) [2022-07-20 22:30:49,089 INFO L895 garLoopResultBuilder]: At program point L112(lines 111 290) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,089 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2022-07-20 22:30:49,089 INFO L895 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: false [2022-07-20 22:30:49,089 INFO L895 garLoopResultBuilder]: At program point L1005(lines 822 1007) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,089 INFO L895 garLoopResultBuilder]: At program point L972(lines 867 1006) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,089 INFO L899 garLoopResultBuilder]: For program point L774(lines 774 791) no Hoare annotation was computed. [2022-07-20 22:30:49,089 INFO L895 garLoopResultBuilder]: At program point L576(lines 576 617) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0)) [2022-07-20 22:30:49,089 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 278) no Hoare annotation was computed. [2022-07-20 22:30:49,090 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 289) no Hoare annotation was computed. [2022-07-20 22:30:49,090 INFO L899 garLoopResultBuilder]: For program point L940(lines 940 943) no Hoare annotation was computed. [2022-07-20 22:30:49,090 INFO L895 garLoopResultBuilder]: At program point L775(lines 774 791) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,090 INFO L895 garLoopResultBuilder]: At program point L742(lines 689 744) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,090 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 726) no Hoare annotation was computed. [2022-07-20 22:30:49,090 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: false [2022-07-20 22:30:49,090 INFO L895 garLoopResultBuilder]: At program point L115(lines 114 289) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,090 INFO L899 garLoopResultBuilder]: For program point L875(lines 875 990) no Hoare annotation was computed. [2022-07-20 22:30:49,090 INFO L899 garLoopResultBuilder]: For program point L809(lines 809 816) no Hoare annotation was computed. [2022-07-20 22:30:49,091 INFO L899 garLoopResultBuilder]: For program point L380(line 380) no Hoare annotation was computed. [2022-07-20 22:30:49,091 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 349) no Hoare annotation was computed. [2022-07-20 22:30:49,091 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 188) no Hoare annotation was computed. [2022-07-20 22:30:49,091 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 177 189) no Hoare annotation was computed. [2022-07-20 22:30:49,091 INFO L895 garLoopResultBuilder]: At program point L777(lines 776 791) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,091 INFO L895 garLoopResultBuilder]: At program point L249(line 249) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,091 INFO L899 garLoopResultBuilder]: For program point L249-1(line 249) no Hoare annotation was computed. [2022-07-20 22:30:49,091 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 277) no Hoare annotation was computed. [2022-07-20 22:30:49,092 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 288) no Hoare annotation was computed. [2022-07-20 22:30:49,092 INFO L899 garLoopResultBuilder]: For program point L910(lines 910 980) no Hoare annotation was computed. [2022-07-20 22:30:49,092 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-07-20 22:30:49,092 INFO L895 garLoopResultBuilder]: At program point L184(line 184) the Hoare annotation is: false [2022-07-20 22:30:49,092 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 600) no Hoare annotation was computed. [2022-07-20 22:30:49,092 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 457) no Hoare annotation was computed. [2022-07-20 22:30:49,092 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-20 22:30:49,092 INFO L895 garLoopResultBuilder]: At program point L218(line 218) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0)) [2022-07-20 22:30:49,092 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2022-07-20 22:30:49,093 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 452) no Hoare annotation was computed. [2022-07-20 22:30:49,093 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 276) no Hoare annotation was computed. [2022-07-20 22:30:49,093 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 287) no Hoare annotation was computed. [2022-07-20 22:30:49,093 INFO L895 garLoopResultBuilder]: At program point L54(lines 43 56) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,093 INFO L895 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: false [2022-07-20 22:30:49,093 INFO L899 garLoopResultBuilder]: For program point L814-1(lines 793 818) no Hoare annotation was computed. [2022-07-20 22:30:49,093 INFO L899 garLoopResultBuilder]: For program point L385(line 385) no Hoare annotation was computed. [2022-07-20 22:30:49,093 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 412) no Hoare annotation was computed. [2022-07-20 22:30:49,093 INFO L895 garLoopResultBuilder]: At program point L354(lines 353 412) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,094 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 275) no Hoare annotation was computed. [2022-07-20 22:30:49,094 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 286) no Hoare annotation was computed. [2022-07-20 22:30:49,094 INFO L899 garLoopResultBuilder]: For program point L883(lines 883 988) no Hoare annotation was computed. [2022-07-20 22:30:49,094 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 456) no Hoare annotation was computed. [2022-07-20 22:30:49,094 INFO L895 garLoopResultBuilder]: At program point L421(lines 414 463) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= 2 ~DC~0)) (.cse2 (not (= ~pended~0 1))) (.cse3 (not (= ~IPC~0 2))) (.cse4 (not (= ~SKIP1~0 ~NP~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~compRegistered~0 0) .cse4) (and (= ~compRegistered~0 1) .cse0 .cse1 (= 2 ~s~0) .cse2 .cse3 .cse4))) [2022-07-20 22:30:49,094 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-20 22:30:49,094 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 229) no Hoare annotation was computed. [2022-07-20 22:30:49,094 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 978) no Hoare annotation was computed. [2022-07-20 22:30:49,094 INFO L895 garLoopResultBuilder]: At program point L884(lines 883 988) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,095 INFO L895 garLoopResultBuilder]: At program point L819(lines 745 821) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,095 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-07-20 22:30:49,095 INFO L895 garLoopResultBuilder]: At program point L258(line 258) the Hoare annotation is: false [2022-07-20 22:30:49,095 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 260) no Hoare annotation was computed. [2022-07-20 22:30:49,095 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 274) no Hoare annotation was computed. [2022-07-20 22:30:49,095 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 285) no Hoare annotation was computed. [2022-07-20 22:30:49,095 INFO L899 garLoopResultBuilder]: For program point L754(lines 754 766) no Hoare annotation was computed. [2022-07-20 22:30:49,095 INFO L899 garLoopResultBuilder]: For program point L754-1(lines 754 766) no Hoare annotation was computed. [2022-07-20 22:30:49,095 INFO L895 garLoopResultBuilder]: At program point L589(lines 581 600) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= (+ ~MPR3~0 (* (- 1) ~s~0)) 0)) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0)) [2022-07-20 22:30:49,096 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 411) no Hoare annotation was computed. [2022-07-20 22:30:49,096 INFO L895 garLoopResultBuilder]: At program point L292(lines 81 294) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= 2 ~DC~0)) (.cse2 (not (= ~pended~0 1))) (.cse3 (not (= ~IPC~0 2))) (.cse4 (not (= ~SKIP1~0 ~NP~0))) (.cse5 (= |ULTIMATE.start_main_~status~1#1| 0))) (or (and (= ~compRegistered~0 1) .cse0 .cse1 (= 2 ~s~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= ~compRegistered~0 0) .cse4 .cse5))) [2022-07-20 22:30:49,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-20 22:30:49,096 INFO L895 garLoopResultBuilder]: At program point L359(lines 358 411) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,096 INFO L895 garLoopResultBuilder]: At program point L227(line 227) the Hoare annotation is: false [2022-07-20 22:30:49,096 INFO L895 garLoopResultBuilder]: At program point L194(lines 194 195) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= |ULTIMATE.start_KbFilter_PnP_~status~0#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0)) [2022-07-20 22:30:49,096 INFO L899 garLoopResultBuilder]: For program point L227-1(lines 223 229) no Hoare annotation was computed. [2022-07-20 22:30:49,096 INFO L899 garLoopResultBuilder]: For program point L194-1(lines 194 195) no Hoare annotation was computed. [2022-07-20 22:30:49,096 INFO L895 garLoopResultBuilder]: At program point L789(lines 753 820) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,097 INFO L895 garLoopResultBuilder]: At program point L756(line 756) the Hoare annotation is: false [2022-07-20 22:30:49,097 INFO L899 garLoopResultBuilder]: For program point L756-1(line 756) no Hoare annotation was computed. [2022-07-20 22:30:49,097 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 273) no Hoare annotation was computed. [2022-07-20 22:30:49,097 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 284) no Hoare annotation was computed. [2022-07-20 22:30:49,097 INFO L895 garLoopResultBuilder]: At program point L724(lines 699 743) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,097 INFO L899 garLoopResultBuilder]: For program point L956(lines 956 958) no Hoare annotation was computed. [2022-07-20 22:30:49,097 INFO L899 garLoopResultBuilder]: For program point L956-2(lines 934 971) no Hoare annotation was computed. [2022-07-20 22:30:49,097 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-20 22:30:49,097 INFO L899 garLoopResultBuilder]: For program point L924(lines 924 976) no Hoare annotation was computed. [2022-07-20 22:30:49,098 INFO L899 garLoopResultBuilder]: For program point L891(lines 891 986) no Hoare annotation was computed. [2022-07-20 22:30:49,098 INFO L899 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2022-07-20 22:30:49,098 INFO L899 garLoopResultBuilder]: For program point L594-1(lines 581 600) no Hoare annotation was computed. [2022-07-20 22:30:49,098 INFO L895 garLoopResultBuilder]: At program point L429(lines 422 462) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= 2 ~DC~0)) (.cse2 (not (= ~pended~0 1))) (.cse3 (not (= ~IPC~0 2))) (.cse4 (not (= ~SKIP1~0 ~NP~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~compRegistered~0 0) .cse4) (and (= ~compRegistered~0 1) .cse0 .cse1 (= 2 ~s~0) .cse2 .cse3 .cse4))) [2022-07-20 22:30:49,098 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 410) no Hoare annotation was computed. [2022-07-20 22:30:49,098 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 413) no Hoare annotation was computed. [2022-07-20 22:30:49,098 INFO L895 garLoopResultBuilder]: At program point L330-1(lines 324 465) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= 2 ~DC~0)) (.cse2 (not (= ~pended~0 1))) (.cse3 (not (= ~IPC~0 2))) (.cse4 (not (= ~SKIP1~0 ~NP~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~compRegistered~0 0) .cse4) (and (= ~compRegistered~0 1) .cse0 .cse1 (= 2 ~s~0) .cse2 .cse3 .cse4))) [2022-07-20 22:30:49,098 INFO L895 garLoopResultBuilder]: At program point L264(lines 264 265) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,098 INFO L899 garLoopResultBuilder]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2022-07-20 22:30:49,099 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 272) no Hoare annotation was computed. [2022-07-20 22:30:49,099 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 283) no Hoare annotation was computed. [2022-07-20 22:30:49,099 INFO L895 garLoopResultBuilder]: At program point L892(lines 891 986) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,099 INFO L899 garLoopResultBuilder]: For program point L760(lines 760 764) no Hoare annotation was computed. [2022-07-20 22:30:49,099 INFO L899 garLoopResultBuilder]: For program point L430(lines 414 463) no Hoare annotation was computed. [2022-07-20 22:30:49,099 INFO L895 garLoopResultBuilder]: At program point L364(lines 363 410) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,099 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-07-20 22:30:49,099 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2022-07-20 22:30:49,099 INFO L899 garLoopResultBuilder]: For program point L959-1(lines 959 961) no Hoare annotation was computed. [2022-07-20 22:30:49,100 INFO L895 garLoopResultBuilder]: At program point L596(line 596) the Hoare annotation is: false [2022-07-20 22:30:49,100 INFO L902 garLoopResultBuilder]: At program point L464(lines 295 466) the Hoare annotation is: true [2022-07-20 22:30:49,100 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 460) no Hoare annotation was computed. [2022-07-20 22:30:49,100 INFO L895 garLoopResultBuilder]: At program point L233(lines 233 234) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2022-07-20 22:30:49,100 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 233 234) no Hoare annotation was computed. [2022-07-20 22:30:49,100 INFO L895 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughENTRY(lines 665 688) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~SKIP2~0 2) (= ~IPC~0 2) (not (= 2 ~DC~0))) [2022-07-20 22:30:49,100 INFO L895 garLoopResultBuilder]: At program point L684(line 684) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~SKIP2~0 2) (= ~IPC~0 2) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-07-20 22:30:49,100 INFO L899 garLoopResultBuilder]: For program point L684-1(line 684) no Hoare annotation was computed. [2022-07-20 22:30:49,100 INFO L899 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughFINAL(lines 665 688) no Hoare annotation was computed. [2022-07-20 22:30:49,101 INFO L895 garLoopResultBuilder]: At program point L678(line 678) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~SKIP2~0 2) (= ~IPC~0 2) (not (= 2 ~DC~0))) [2022-07-20 22:30:49,101 INFO L899 garLoopResultBuilder]: For program point L678-1(lines 674 680) no Hoare annotation was computed. [2022-07-20 22:30:49,101 INFO L899 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughEXIT(lines 665 688) no Hoare annotation was computed. [2022-07-20 22:30:49,101 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 680) no Hoare annotation was computed. [2022-07-20 22:30:49,101 INFO L895 garLoopResultBuilder]: At program point L510(lines 509 526) the Hoare annotation is: (let ((.cse2 (= ~NP~0 |old(~s~0)|)) (.cse0 (= ~pended~0 1)) (.cse1 (= ~SKIP2~0 2)) (.cse3 (= ~IPC~0 2)) (.cse4 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not .cse2) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse3 .cse4 (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)))) [2022-07-20 22:30:49,101 INFO L899 garLoopResultBuilder]: For program point L532(lines 532 549) no Hoare annotation was computed. [2022-07-20 22:30:49,101 INFO L895 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 481 553) the Hoare annotation is: (let ((.cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse3 (= ~NP~0 |old(~s~0)|)) (.cse1 (= ~pended~0 1)) (.cse2 (= ~SKIP2~0 2)) (.cse4 (= ~IPC~0 2)) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5) (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) .cse0 (not .cse3) .cse1 (not (<= 5 ~MPR1~0)) .cse2 .cse4 .cse5 (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)))) [2022-07-20 22:30:49,101 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2022-07-20 22:30:49,102 INFO L895 garLoopResultBuilder]: At program point L524(lines 488 552) the Hoare annotation is: (let ((.cse2 (= ~NP~0 |old(~s~0)|)) (.cse0 (= ~pended~0 1)) (.cse1 (= ~SKIP2~0 2)) (.cse3 (= ~IPC~0 2)) (.cse4 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (let ((.cse5 (= ~MPR1~0 ~s~0)) (.cse6 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0) .cse5 .cse6) (and (= IofCallDriver_~returnVal2~0 0) .cse5 .cse6) (not .cse2) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse3 (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse5 .cse6) .cse4 (not (= ~compRegistered~0 1)) (= ~MPR3~0 1))))) [2022-07-20 22:30:49,102 INFO L895 garLoopResultBuilder]: At program point L491(line 491) the Hoare annotation is: (let ((.cse2 (= ~NP~0 |old(~s~0)|)) (.cse0 (= ~pended~0 1)) (.cse1 (= ~SKIP2~0 2)) (.cse3 (= ~IPC~0 2)) (.cse4 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse2) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse3 .cse4 (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)))) [2022-07-20 22:30:49,102 INFO L899 garLoopResultBuilder]: For program point L491-1(line 491) no Hoare annotation was computed. [2022-07-20 22:30:49,102 INFO L899 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 481 553) no Hoare annotation was computed. [2022-07-20 22:30:49,102 INFO L895 garLoopResultBuilder]: At program point L512(lines 511 526) the Hoare annotation is: (let ((.cse2 (= ~NP~0 |old(~s~0)|)) (.cse0 (= ~pended~0 1)) (.cse1 (= ~SKIP2~0 2)) (.cse3 (= ~IPC~0 2)) (.cse4 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not .cse2) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse3 .cse4 (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)))) [2022-07-20 22:30:49,102 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 548) no Hoare annotation was computed. [2022-07-20 22:30:49,102 INFO L899 garLoopResultBuilder]: For program point L504(lines 504 527) no Hoare annotation was computed. [2022-07-20 22:30:49,102 INFO L899 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 481 553) no Hoare annotation was computed. [2022-07-20 22:30:49,103 INFO L899 garLoopResultBuilder]: For program point L533(lines 533 539) no Hoare annotation was computed. [2022-07-20 22:30:49,103 INFO L895 garLoopResultBuilder]: At program point L546(line 546) the Hoare annotation is: (let ((.cse2 (= ~NP~0 |old(~s~0)|)) (.cse0 (= ~pended~0 1)) (.cse1 (= ~SKIP2~0 2)) (.cse3 (= ~IPC~0 2)) (.cse4 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not .cse2) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse3 .cse4 (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)))) [2022-07-20 22:30:49,103 INFO L899 garLoopResultBuilder]: For program point L546-1(lines 528 550) no Hoare annotation was computed. [2022-07-20 22:30:49,103 INFO L899 garLoopResultBuilder]: For program point L509(lines 509 526) no Hoare annotation was computed. [2022-07-20 22:30:49,103 INFO L895 garLoopResultBuilder]: At program point L505(lines 504 527) the Hoare annotation is: (let ((.cse2 (= ~NP~0 |old(~s~0)|)) (.cse0 (= ~pended~0 1)) (.cse1 (= ~SKIP2~0 2)) (.cse3 (= ~IPC~0 2)) (.cse4 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not .cse2) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse3 .cse4 (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)))) [2022-07-20 22:30:49,103 INFO L895 garLoopResultBuilder]: At program point L497(line 497) the Hoare annotation is: (let ((.cse1 (= ~pended~0 1)) (.cse2 (= ~SKIP2~0 2)) (.cse0 (= ~NP~0 |old(~s~0)|)) (.cse3 (= ~IPC~0 2)) (.cse4 (not (= 2 ~DC~0)))) (and (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not .cse0) .cse1 (not (<= 5 ~MPR1~0)) .cse2 .cse3 .cse4 (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)) (or (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse0 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-07-20 22:30:49,103 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 501) no Hoare annotation was computed. [2022-07-20 22:30:49,103 INFO L899 garLoopResultBuilder]: For program point L489-1(lines 489 501) no Hoare annotation was computed. [2022-07-20 22:30:49,104 INFO L895 garLoopResultBuilder]: At program point L475(line 475) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (= ~SKIP2~0 2) (= ~IPC~0 2) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)) [2022-07-20 22:30:49,104 INFO L899 garLoopResultBuilder]: For program point L475-1(lines 467 480) no Hoare annotation was computed. [2022-07-20 22:30:49,104 INFO L895 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 467 480) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (= ~SKIP2~0 2) (= ~IPC~0 2) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)) [2022-07-20 22:30:49,104 INFO L899 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 467 480) no Hoare annotation was computed. [2022-07-20 22:30:49,106 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:30:49,108 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 22:30:49,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:30:49 BoogieIcfgContainer [2022-07-20 22:30:49,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 22:30:49,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 22:30:49,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 22:30:49,138 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 22:30:49,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:30:43" (3/4) ... [2022-07-20 22:30:49,140 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-20 22:30:49,144 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2022-07-20 22:30:49,144 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_CreateClose [2022-07-20 22:30:49,144 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-07-20 22:30:49,144 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-07-20 22:30:49,144 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_DispatchPassThrough [2022-07-20 22:30:49,145 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-07-20 22:30:49,145 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2022-07-20 22:30:49,154 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2022-07-20 22:30:49,155 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-07-20 22:30:49,159 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-20 22:30:49,160 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-20 22:30:49,180 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || SKIP2 == 2) || NP == \old(s)) || IPC == 2) || !(SKIP1 == \old(s))) || !(2 == DC)) && ((((((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || IPC == 2) || !(2 == DC)) || !(compRegistered == 1)) || MPR3 == 1) [2022-07-20 22:30:49,182 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || SKIP2 == 2) || NP == \old(s)) || IPC == 2) || !(SKIP1 == \old(s))) || !(2 == DC)) && ((((((((((((SKIP1 == NP || !(NP == 1)) || ((1073741823 + returnVal2 <= 0 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || ((returnVal2 == 0 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || IPC == 2) || ((((setEventCalled == 1 && returnVal2 <= 259) && 259 <= returnVal2) && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(2 == DC)) || !(compRegistered == 1)) || MPR3 == 1) [2022-07-20 22:30:49,184 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || SKIP2 == 2) || NP == \old(s)) || IPC == 2) || !(SKIP1 == \old(s))) || !(2 == DC)) && ((((((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || IPC == 2) || !(2 == DC)) || !(compRegistered == 1)) || MPR3 == 1) [2022-07-20 22:30:49,184 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || SKIP2 == 2) || NP == \old(s)) || IPC == 2) || !(SKIP1 == \old(s))) || !(2 == DC)) && ((((((((((SKIP1 == NP || !(NP == 1)) || ((setEventCalled == 1 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || IPC == 2) || !(2 == DC)) || !(compRegistered == 1)) || MPR3 == 1) [2022-07-20 22:30:49,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || SKIP2 == 2) || IPC == 2) || !(2 == DC) [2022-07-20 22:30:49,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || SKIP2 == 2) || IPC == 2) || !(2 == DC) [2022-07-20 22:30:49,235 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 22:30:49,235 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 22:30:49,235 INFO L158 Benchmark]: Toolchain (without parser) took 6453.45ms. Allocated memory was 58.7MB in the beginning and 144.7MB in the end (delta: 86.0MB). Free memory was 36.9MB in the beginning and 111.6MB in the end (delta: -74.7MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2022-07-20 22:30:49,238 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 58.7MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:30:49,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.75ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 36.6MB in the beginning and 51.3MB in the end (delta: -14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-20 22:30:49,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.81ms. Allocated memory is still 75.5MB. Free memory was 51.3MB in the beginning and 47.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 22:30:49,239 INFO L158 Benchmark]: Boogie Preprocessor took 39.85ms. Allocated memory is still 75.5MB. Free memory was 47.6MB in the beginning and 45.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 22:30:49,239 INFO L158 Benchmark]: RCFGBuilder took 657.12ms. Allocated memory is still 75.5MB. Free memory was 45.0MB in the beginning and 46.8MB in the end (delta: -1.9MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2022-07-20 22:30:49,239 INFO L158 Benchmark]: TraceAbstraction took 5316.83ms. Allocated memory was 75.5MB in the beginning and 144.7MB in the end (delta: 69.2MB). Free memory was 46.1MB in the beginning and 39.0MB in the end (delta: 7.1MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2022-07-20 22:30:49,240 INFO L158 Benchmark]: Witness Printer took 97.81ms. Allocated memory is still 144.7MB. Free memory was 122.5MB in the beginning and 111.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 22:30:49,246 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.23ms. Allocated memory is still 58.7MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.75ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 36.6MB in the beginning and 51.3MB in the end (delta: -14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.81ms. Allocated memory is still 75.5MB. Free memory was 51.3MB in the beginning and 47.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.85ms. Allocated memory is still 75.5MB. Free memory was 47.6MB in the beginning and 45.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 657.12ms. Allocated memory is still 75.5MB. Free memory was 45.0MB in the beginning and 46.8MB in the end (delta: -1.9MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5316.83ms. Allocated memory was 75.5MB in the beginning and 144.7MB in the end (delta: 69.2MB). Free memory was 46.1MB in the beginning and 39.0MB in the end (delta: 7.1MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. * Witness Printer took 97.81ms. Allocated memory is still 144.7MB. Free memory was 122.5MB in the beginning and 111.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. 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: 1013]: 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 8 procedures, 208 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2706 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2687 mSDsluCounter, 7747 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4467 mSDsCounter, 382 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1647 IncrementalHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 382 mSolverCounterUnsat, 3280 mSDtfsCounter, 1647 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=6, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 111 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 274 PreInvPairs, 354 NumberOfFragments, 2542 HoareAnnotationTreeSize, 274 FomulaSimplifications, 296 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 76 FomulaSimplificationsInter, 3097 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 856 NumberOfCodeBlocks, 856 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 2186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 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: 43]: Loop Invariant Derived loop invariant: (((((((((!(SKIP2 == 2) && 5 <= MPR1) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && NP == 1) && !(MPR3 == 1)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) && status == 0) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || SKIP2 == 2) || IPC == 2) || !(2 == DC) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || SKIP2 == 2) || NP == \old(s)) || IPC == 2) || !(SKIP1 == \old(s))) || !(2 == DC)) && ((((((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || IPC == 2) || !(2 == DC)) || !(compRegistered == 1)) || MPR3 == 1) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && compRegistered <= 0) && !(SKIP1 == NP)) || ((((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && 2 == s) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((((!(SKIP2 == 2) && 5 <= MPR1) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && status == 0) && !(SKIP1 == NP)) && NP == 1) && !(MPR3 == 1)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && !(MPR3 + -1 * s == 0)) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0 - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: ((((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0 - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && compRegistered <= 0) && !(SKIP1 == NP)) || ((((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && 2 == s) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || SKIP2 == 2) || NP == \old(s)) || IPC == 2) || !(SKIP1 == \old(s))) || !(2 == DC)) && ((((((((((((SKIP1 == NP || !(NP == 1)) || ((1073741823 + returnVal2 <= 0 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || ((returnVal2 == 0 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || IPC == 2) || ((((setEventCalled == 1 && returnVal2 <= 259) && 259 <= returnVal2) && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(2 == DC)) || !(compRegistered == 1)) || MPR3 == 1) - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: ((((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0 - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) && status == 0) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 822]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) && status == 0) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: ((((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0 - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (!(pended == 1) && !(SKIP1 == NP)) && ((((!(SKIP2 == 2) && 2 == DC) && !(IPC == 2)) && compRegistered <= 0) || (((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && !(IPC == 2))) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: (((((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && 2 == s) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) && status == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && compRegistered <= 0) && !(SKIP1 == NP)) && status == 0) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || SKIP2 == 2) || IPC == 2) || !(2 == DC) - InvariantResult [Line: 776]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) && status == 0) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: (((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || SKIP2 == 2) || NP == \old(s)) || IPC == 2) || !(SKIP1 == \old(s))) || !(2 == DC)) && ((((((((((SKIP1 == NP || !(NP == 1)) || ((setEventCalled == 1 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || IPC == 2) || !(2 == DC)) || !(compRegistered == 1)) || MPR3 == 1) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: (((((((((SKIP1 == NP || setEventCalled == 1) || pended == 1) || !(s == NP)) || !(5 <= MPR1)) || SKIP2 == 2) || IPC == 2) || !(2 == DC)) || !(compRegistered == 1)) || !(s == 1)) || MPR3 == 1 - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((((!(SKIP2 == 2) && 5 <= MPR1) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && NP == 1) && !(MPR3 == 1)) && status == 0) && compRegistered == 0 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && compRegistered <= 0) && !(SKIP1 == NP)) || ((((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && 2 == s) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && 2 == s) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) && status == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && compRegistered <= 0) && !(SKIP1 == NP)) && status == 0) - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || SKIP2 == 2) || NP == \old(s)) || IPC == 2) || !(SKIP1 == \old(s))) || !(2 == DC)) && ((((((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || IPC == 2) || !(2 == DC)) || !(compRegistered == 1)) || MPR3 == 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((!(SKIP2 == 2) && 5 <= MPR1) && 2 == DC) && !(s == NP)) && !(pended == 1)) && !(IPC == 2)) && !(SKIP1 == NP)) && NP == 1) && !(MPR3 == 1)) && status == 0) && compRegistered == 0) && !(MPR3 == s) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && compRegistered == 0 RESULT: Ultimate proved your program to be correct! [2022-07-20 22:30:49,298 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