./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 791161d1 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-?-791161d [2022-07-22 11:08:40,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:08:40,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:08:40,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:08:40,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:08:40,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:08:40,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:08:40,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:08:40,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:08:40,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:08:40,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:08:40,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:08:40,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:08:40,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:08:40,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:08:40,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:08:40,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:08:40,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:08:40,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:08:40,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:08:40,356 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:08:40,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:08:40,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:08:40,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:08:40,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:08:40,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:08:40,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:08:40,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:08:40,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:08:40,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:08:40,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:08:40,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:08:40,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:08:40,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:08:40,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:08:40,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:08:40,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:08:40,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:08:40,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:08:40,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:08:40,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:08:40,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:08:40,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 11:08:40,392 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:08:40,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:08:40,393 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:08:40,393 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:08:40,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:08:40,394 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:08:40,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:08:40,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:08:40,394 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:08:40,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:08:40,395 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:08:40,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:08:40,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:08:40,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:08:40,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:08:40,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:08:40,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:08:40,396 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:08:40,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:08:40,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:08:40,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:08:40,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:08:40,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:08:40,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:08:40,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:08:40,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:08:40,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:08:40,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:08:40,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:08:40,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:08:40,398 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:08:40,398 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:08:40,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:08:40,399 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-22 11:08:40,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:08:40,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:08:40,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:08:40,611 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:08:40,611 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:08:40,612 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-22 11:08:40,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecad5d3af/346c3a2dc4d848e28d1a6d2096518e40/FLAG6a4294271 [2022-07-22 11:08:40,971 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:08:40,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-07-22 11:08:40,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecad5d3af/346c3a2dc4d848e28d1a6d2096518e40/FLAG6a4294271 [2022-07-22 11:08:41,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecad5d3af/346c3a2dc4d848e28d1a6d2096518e40 [2022-07-22 11:08:41,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:08:41,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:08:41,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:08:41,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:08:41,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:08:41,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:08:41" (1/1) ... [2022-07-22 11:08:41,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79619977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41, skipping insertion in model container [2022-07-22 11:08:41,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:08:41" (1/1) ... [2022-07-22 11:08:41,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:08:41,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:08:41,631 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-22 11:08:41,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:08:41,638 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:08:41,684 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-22 11:08:41,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:08:41,698 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:08:41,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41 WrapperNode [2022-07-22 11:08:41,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:08:41,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:08:41,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:08:41,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:08:41,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41" (1/1) ... [2022-07-22 11:08:41,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41" (1/1) ... [2022-07-22 11:08:41,754 INFO L137 Inliner]: procedures = 29, calls = 43, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 662 [2022-07-22 11:08:41,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:08:41,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:08:41,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:08:41,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:08:41,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41" (1/1) ... [2022-07-22 11:08:41,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41" (1/1) ... [2022-07-22 11:08:41,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41" (1/1) ... [2022-07-22 11:08:41,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41" (1/1) ... [2022-07-22 11:08:41,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41" (1/1) ... [2022-07-22 11:08:41,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41" (1/1) ... [2022-07-22 11:08:41,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41" (1/1) ... [2022-07-22 11:08:41,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:08:41,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:08:41,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:08:41,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:08:41,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41" (1/1) ... [2022-07-22 11:08:41,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:08:41,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:08:41,845 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-22 11:08:41,868 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-22 11:08:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:08:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-22 11:08:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-22 11:08:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-22 11:08:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-22 11:08:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-22 11:08:41,887 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-22 11:08:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-22 11:08:41,887 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-22 11:08:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-22 11:08:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-22 11:08:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:08:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-22 11:08:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-22 11:08:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:08:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:08:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-22 11:08:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-22 11:08:41,990 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:08:41,991 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:08:42,109 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:08:42,112 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:08:42,114 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:08:42,116 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:08:42,117 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:08:42,315 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-07-22 11:08:42,316 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-07-22 11:08:42,316 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-07-22 11:08:42,316 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-07-22 11:08:42,316 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-07-22 11:08:42,316 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-07-22 11:08:42,316 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-22 11:08:42,316 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-22 11:08:42,317 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-07-22 11:08:42,317 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-07-22 11:08:42,324 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:08:42,338 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-22 11:08:42,339 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-22 11:08:42,344 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:08:42,349 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:08:42,350 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 11:08:42,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:08:42 BoogieIcfgContainer [2022-07-22 11:08:42,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:08:42,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:08:42,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:08:42,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:08:42,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:08:41" (1/3) ... [2022-07-22 11:08:42,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d332179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:08:42, skipping insertion in model container [2022-07-22 11:08:42,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:08:41" (2/3) ... [2022-07-22 11:08:42,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d332179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:08:42, skipping insertion in model container [2022-07-22 11:08:42,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:08:42" (3/3) ... [2022-07-22 11:08:42,357 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2022-07-22 11:08:42,366 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:08:42,366 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:08:42,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:08:42,411 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@71d2c7f2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@17c3dc05 [2022-07-22 11:08:42,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:08:42,415 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-22 11:08:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 11:08:42,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:42,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:08:42,421 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:42,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:42,424 INFO L85 PathProgramCache]: Analyzing trace with hash -809123790, now seen corresponding path program 1 times [2022-07-22 11:08:42,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:42,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303253218] [2022-07-22 11:08:42,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:42,558 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-22 11:08:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:42,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303253218] [2022-07-22 11:08:42,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303253218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:42,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:42,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:08:42,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157025291] [2022-07-22 11:08:42,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:42,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:08:42,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:42,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:08:42,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:08:42,588 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-22 11:08:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:42,659 INFO L93 Difference]: Finished difference Result 338 states and 529 transitions. [2022-07-22 11:08:42,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:08:42,661 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-22 11:08:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:42,674 INFO L225 Difference]: With dead ends: 338 [2022-07-22 11:08:42,674 INFO L226 Difference]: Without dead ends: 198 [2022-07-22 11:08:42,680 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-22 11:08:42,683 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-22 11:08:42,683 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-22 11:08:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-22 11:08:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-07-22 11:08:42,721 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-22 11:08:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2022-07-22 11:08:42,725 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 13 [2022-07-22 11:08:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:42,725 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2022-07-22 11:08:42,725 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-22 11:08:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2022-07-22 11:08:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 11:08:42,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:42,726 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-22 11:08:42,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:08:42,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:42,727 INFO L85 PathProgramCache]: Analyzing trace with hash 900719787, now seen corresponding path program 1 times [2022-07-22 11:08:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:42,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753048658] [2022-07-22 11:08:42,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:42,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:42,781 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-22 11:08:42,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:42,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753048658] [2022-07-22 11:08:42,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753048658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:42,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:42,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:08:42,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091017965] [2022-07-22 11:08:42,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:42,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:08:42,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:42,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:08:42,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:08:42,784 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-22 11:08:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:42,882 INFO L93 Difference]: Finished difference Result 314 states and 449 transitions. [2022-07-22 11:08:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:08:42,883 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-22 11:08:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:42,887 INFO L225 Difference]: With dead ends: 314 [2022-07-22 11:08:42,887 INFO L226 Difference]: Without dead ends: 262 [2022-07-22 11:08:42,888 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-22 11:08:42,889 INFO L413 NwaCegarLoop]: 320 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, 426 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-22 11:08:42,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 426 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:08:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-22 11:08:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 249. [2022-07-22 11:08:42,904 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-22 11:08:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 357 transitions. [2022-07-22 11:08:42,905 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 357 transitions. Word has length 19 [2022-07-22 11:08:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:42,906 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 357 transitions. [2022-07-22 11:08:42,906 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-22 11:08:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 357 transitions. [2022-07-22 11:08:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 11:08:42,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:42,907 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-22 11:08:42,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:08:42,907 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:42,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043530, now seen corresponding path program 1 times [2022-07-22 11:08:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:42,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139067929] [2022-07-22 11:08:42,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:42,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:42,941 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-22 11:08:42,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:42,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139067929] [2022-07-22 11:08:42,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139067929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:42,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:42,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:08:42,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221046023] [2022-07-22 11:08:42,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:42,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:08:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:42,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:08:42,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:08:42,943 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-22 11:08:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:42,959 INFO L93 Difference]: Finished difference Result 402 states and 557 transitions. [2022-07-22 11:08:42,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:08:42,959 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-22 11:08:42,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:42,961 INFO L225 Difference]: With dead ends: 402 [2022-07-22 11:08:42,961 INFO L226 Difference]: Without dead ends: 306 [2022-07-22 11:08:42,962 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-22 11:08:42,962 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-22 11:08:42,963 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-22 11:08:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-22 11:08:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 287. [2022-07-22 11:08:42,975 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-22 11:08:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 406 transitions. [2022-07-22 11:08:42,976 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 406 transitions. Word has length 18 [2022-07-22 11:08:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:42,977 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 406 transitions. [2022-07-22 11:08:42,977 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-22 11:08:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 406 transitions. [2022-07-22 11:08:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 11:08:42,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:42,978 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-22 11:08:42,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 11:08:42,979 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:42,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2086831099, now seen corresponding path program 1 times [2022-07-22 11:08:42,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:42,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698379298] [2022-07-22 11:08:42,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:42,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:43,073 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-22 11:08:43,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:43,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698379298] [2022-07-22 11:08:43,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698379298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:43,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:43,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:08:43,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091254466] [2022-07-22 11:08:43,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:43,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:08:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:43,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:08:43,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:08:43,077 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-22 11:08:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:43,127 INFO L93 Difference]: Finished difference Result 290 states and 408 transitions. [2022-07-22 11:08:43,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:08:43,127 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-22 11:08:43,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:43,130 INFO L225 Difference]: With dead ends: 290 [2022-07-22 11:08:43,130 INFO L226 Difference]: Without dead ends: 286 [2022-07-22 11:08:43,130 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-22 11:08:43,139 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-22 11:08:43,139 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-22 11:08:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-22 11:08:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-07-22 11:08:43,154 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-22 11:08:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 403 transitions. [2022-07-22 11:08:43,156 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 403 transitions. Word has length 29 [2022-07-22 11:08:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:43,157 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 403 transitions. [2022-07-22 11:08:43,157 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-22 11:08:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 403 transitions. [2022-07-22 11:08:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-22 11:08:43,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:43,162 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-22 11:08:43,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 11:08:43,162 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:43,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:43,163 INFO L85 PathProgramCache]: Analyzing trace with hash -507734156, now seen corresponding path program 1 times [2022-07-22 11:08:43,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:43,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682067313] [2022-07-22 11:08:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:43,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:43,275 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-22 11:08:43,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:43,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682067313] [2022-07-22 11:08:43,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682067313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:43,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:43,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 11:08:43,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610603857] [2022-07-22 11:08:43,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:43,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:08:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:43,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:08:43,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:08:43,281 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-22 11:08:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:43,418 INFO L93 Difference]: Finished difference Result 308 states and 427 transitions. [2022-07-22 11:08:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:08:43,419 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-22 11:08:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:43,422 INFO L225 Difference]: With dead ends: 308 [2022-07-22 11:08:43,422 INFO L226 Difference]: Without dead ends: 303 [2022-07-22 11:08:43,422 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-22 11:08:43,424 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-22 11:08:43,424 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-22 11:08:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-22 11:08:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2022-07-22 11:08:43,454 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-22 11:08:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 415 transitions. [2022-07-22 11:08:43,456 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 415 transitions. Word has length 33 [2022-07-22 11:08:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:43,456 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 415 transitions. [2022-07-22 11:08:43,456 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-22 11:08:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 415 transitions. [2022-07-22 11:08:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 11:08:43,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:43,460 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-22 11:08:43,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 11:08:43,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:43,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1061247362, now seen corresponding path program 1 times [2022-07-22 11:08:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:43,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155683247] [2022-07-22 11:08:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:43,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:43,556 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-22 11:08:43,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:43,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155683247] [2022-07-22 11:08:43,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155683247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:43,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:43,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 11:08:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195569218] [2022-07-22 11:08:43,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:43,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:08:43,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:43,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:08:43,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:08:43,558 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-22 11:08:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:43,675 INFO L93 Difference]: Finished difference Result 308 states and 426 transitions. [2022-07-22 11:08:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:08:43,676 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-22 11:08:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:43,678 INFO L225 Difference]: With dead ends: 308 [2022-07-22 11:08:43,678 INFO L226 Difference]: Without dead ends: 303 [2022-07-22 11:08:43,679 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-22 11:08:43,680 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-22 11:08:43,680 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-22 11:08:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-22 11:08:43,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2022-07-22 11:08:43,691 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-22 11:08:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 416 transitions. [2022-07-22 11:08:43,692 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 416 transitions. Word has length 34 [2022-07-22 11:08:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:43,693 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 416 transitions. [2022-07-22 11:08:43,693 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-22 11:08:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 416 transitions. [2022-07-22 11:08:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 11:08:43,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:43,694 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-22 11:08:43,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 11:08:43,694 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:43,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:43,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1403318816, now seen corresponding path program 1 times [2022-07-22 11:08:43,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:43,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770301233] [2022-07-22 11:08:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:43,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:43,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:43,748 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-22 11:08:43,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:43,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770301233] [2022-07-22 11:08:43,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770301233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:43,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:43,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:08:43,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480328475] [2022-07-22 11:08:43,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:43,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:08:43,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:43,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:08:43,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:08:43,749 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-22 11:08:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:43,864 INFO L93 Difference]: Finished difference Result 336 states and 455 transitions. [2022-07-22 11:08:43,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:08:43,865 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-22 11:08:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:43,866 INFO L225 Difference]: With dead ends: 336 [2022-07-22 11:08:43,866 INFO L226 Difference]: Without dead ends: 278 [2022-07-22 11:08:43,866 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-22 11:08:43,867 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-22 11:08:43,867 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-22 11:08:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-22 11:08:43,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 264. [2022-07-22 11:08:43,878 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-22 11:08:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 365 transitions. [2022-07-22 11:08:43,879 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 365 transitions. Word has length 34 [2022-07-22 11:08:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:43,879 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 365 transitions. [2022-07-22 11:08:43,879 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-22 11:08:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 365 transitions. [2022-07-22 11:08:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 11:08:43,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:43,880 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-22 11:08:43,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 11:08:43,880 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817110, now seen corresponding path program 1 times [2022-07-22 11:08:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:43,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233416696] [2022-07-22 11:08:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:43,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:43,905 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-22 11:08:43,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:43,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233416696] [2022-07-22 11:08:43,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233416696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:43,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:43,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:08:43,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172134334] [2022-07-22 11:08:43,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:43,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:08:43,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:43,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:08:43,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:08:43,907 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-22 11:08:43,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:43,991 INFO L93 Difference]: Finished difference Result 317 states and 429 transitions. [2022-07-22 11:08:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:08:43,992 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-22 11:08:43,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:43,993 INFO L225 Difference]: With dead ends: 317 [2022-07-22 11:08:43,993 INFO L226 Difference]: Without dead ends: 282 [2022-07-22 11:08:43,993 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-22 11:08:43,994 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 289 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-22 11:08:43,994 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-22 11:08:43,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-22 11:08:44,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 264. [2022-07-22 11:08:44,005 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-22 11:08:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 363 transitions. [2022-07-22 11:08:44,006 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 363 transitions. Word has length 34 [2022-07-22 11:08:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:44,006 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 363 transitions. [2022-07-22 11:08:44,006 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-22 11:08:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 363 transitions. [2022-07-22 11:08:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 11:08:44,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:44,007 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-22 11:08:44,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 11:08:44,007 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:44,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:44,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1671852310, now seen corresponding path program 1 times [2022-07-22 11:08:44,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:44,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516094634] [2022-07-22 11:08:44,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,029 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-22 11:08:44,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:44,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516094634] [2022-07-22 11:08:44,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516094634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:44,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:44,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:08:44,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507324561] [2022-07-22 11:08:44,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:44,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:08:44,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:44,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:08:44,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:08:44,030 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-22 11:08:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:44,092 INFO L93 Difference]: Finished difference Result 278 states and 380 transitions. [2022-07-22 11:08:44,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:08:44,092 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-22 11:08:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:44,092 INFO L225 Difference]: With dead ends: 278 [2022-07-22 11:08:44,092 INFO L226 Difference]: Without dead ends: 82 [2022-07-22 11:08:44,093 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-22 11:08:44,093 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-22 11:08:44,093 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-22 11:08:44,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-22 11:08:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-22 11:08:44,096 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-22 11:08:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2022-07-22 11:08:44,097 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 35 [2022-07-22 11:08:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:44,097 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2022-07-22 11:08:44,097 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-22 11:08:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2022-07-22 11:08:44,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 11:08:44,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:44,097 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-22 11:08:44,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 11:08:44,097 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:44,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:44,098 INFO L85 PathProgramCache]: Analyzing trace with hash 965976384, now seen corresponding path program 1 times [2022-07-22 11:08:44,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:44,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606482852] [2022-07-22 11:08:44,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:44,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 11:08:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 11:08:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,124 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-22 11:08:44,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:44,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606482852] [2022-07-22 11:08:44,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606482852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:44,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:44,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:08:44,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817265899] [2022-07-22 11:08:44,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:44,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:08:44,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:44,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:08:44,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:08:44,125 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-22 11:08:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:44,169 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-07-22 11:08:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:08:44,171 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-22 11:08:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:44,171 INFO L225 Difference]: With dead ends: 106 [2022-07-22 11:08:44,171 INFO L226 Difference]: Without dead ends: 80 [2022-07-22 11:08:44,171 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-22 11:08:44,172 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-22 11:08:44,172 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-22 11:08:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-22 11:08:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-22 11:08:44,175 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-22 11:08:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2022-07-22 11:08:44,175 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 39 [2022-07-22 11:08:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:44,175 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2022-07-22 11:08:44,175 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-22 11:08:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-07-22 11:08:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 11:08:44,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:44,176 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-22 11:08:44,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 11:08:44,176 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:44,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:44,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1309646071, now seen corresponding path program 1 times [2022-07-22 11:08:44,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:44,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288324460] [2022-07-22 11:08:44,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:44,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:08:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,221 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-22 11:08:44,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:44,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288324460] [2022-07-22 11:08:44,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288324460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:44,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:44,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 11:08:44,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137908806] [2022-07-22 11:08:44,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:44,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 11:08:44,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:44,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 11:08:44,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:08:44,222 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-22 11:08:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:44,282 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2022-07-22 11:08:44,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 11:08:44,282 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-22 11:08:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:44,283 INFO L225 Difference]: With dead ends: 126 [2022-07-22 11:08:44,283 INFO L226 Difference]: Without dead ends: 91 [2022-07-22 11:08:44,283 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-22 11:08:44,283 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.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:08:44,284 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.0s Time] [2022-07-22 11:08:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-22 11:08:44,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2022-07-22 11:08:44,291 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-22 11:08:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-07-22 11:08:44,291 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 41 [2022-07-22 11:08:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:44,291 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-07-22 11:08:44,291 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-22 11:08:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-07-22 11:08:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 11:08:44,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:44,292 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-22 11:08:44,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 11:08:44,292 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:44,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1579777203, now seen corresponding path program 1 times [2022-07-22 11:08:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:44,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153557729] [2022-07-22 11:08:44,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:08:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,335 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-22 11:08:44,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:44,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153557729] [2022-07-22 11:08:44,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153557729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:44,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:44,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 11:08:44,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114323417] [2022-07-22 11:08:44,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:44,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 11:08:44,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:44,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 11:08:44,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:08:44,336 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-22 11:08:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:44,398 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-07-22 11:08:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 11:08:44,398 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-22 11:08:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:44,399 INFO L225 Difference]: With dead ends: 96 [2022-07-22 11:08:44,399 INFO L226 Difference]: Without dead ends: 89 [2022-07-22 11:08:44,399 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-22 11:08:44,399 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-22 11:08:44,400 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-22 11:08:44,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-22 11:08:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-07-22 11:08:44,403 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-22 11:08:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2022-07-22 11:08:44,403 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 43 [2022-07-22 11:08:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:44,403 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2022-07-22 11:08:44,403 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-22 11:08:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2022-07-22 11:08:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 11:08:44,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:44,404 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-22 11:08:44,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 11:08:44,404 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:44,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1941659704, now seen corresponding path program 1 times [2022-07-22 11:08:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:44,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191947208] [2022-07-22 11:08:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:08:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,432 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-22 11:08:44,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:44,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191947208] [2022-07-22 11:08:44,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191947208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:44,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:44,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:08:44,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690457196] [2022-07-22 11:08:44,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:44,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:08:44,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:44,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:08:44,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:08:44,433 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-22 11:08:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:44,469 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2022-07-22 11:08:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:08:44,469 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-22 11:08:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:44,470 INFO L225 Difference]: With dead ends: 102 [2022-07-22 11:08:44,470 INFO L226 Difference]: Without dead ends: 97 [2022-07-22 11:08:44,470 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-22 11:08:44,470 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-22 11:08:44,470 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-22 11:08:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-22 11:08:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2022-07-22 11:08:44,474 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-22 11:08:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2022-07-22 11:08:44,474 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 42 [2022-07-22 11:08:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:44,474 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2022-07-22 11:08:44,474 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-22 11:08:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2022-07-22 11:08:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 11:08:44,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:44,475 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-22 11:08:44,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 11:08:44,475 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:44,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:44,475 INFO L85 PathProgramCache]: Analyzing trace with hash 598103956, now seen corresponding path program 1 times [2022-07-22 11:08:44,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:44,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328236017] [2022-07-22 11:08:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:44,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:08:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,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-22 11:08:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:44,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328236017] [2022-07-22 11:08:44,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328236017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:44,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:44,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:08:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154922798] [2022-07-22 11:08:44,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:44,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:08:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:44,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:08:44,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:08:44,503 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-22 11:08:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:44,557 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2022-07-22 11:08:44,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:08:44,557 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-22 11:08:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:44,558 INFO L225 Difference]: With dead ends: 174 [2022-07-22 11:08:44,558 INFO L226 Difference]: Without dead ends: 167 [2022-07-22 11:08:44,558 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-22 11:08:44,558 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-22 11:08:44,559 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-22 11:08:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-22 11:08:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2022-07-22 11:08:44,565 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-22 11:08:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2022-07-22 11:08:44,565 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 44 [2022-07-22 11:08:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:44,565 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2022-07-22 11:08:44,565 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-22 11:08:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2022-07-22 11:08:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 11:08:44,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:44,566 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-22 11:08:44,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 11:08:44,566 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:44,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1921855978, now seen corresponding path program 1 times [2022-07-22 11:08:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:44,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995266305] [2022-07-22 11:08:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:44,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:08:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,631 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-22 11:08:44,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:44,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995266305] [2022-07-22 11:08:44,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995266305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:44,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:44,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 11:08:44,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305549600] [2022-07-22 11:08:44,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:44,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 11:08:44,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:44,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 11:08:44,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 11:08:44,632 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-22 11:08:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:44,674 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2022-07-22 11:08:44,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:08:44,674 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-22 11:08:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:44,675 INFO L225 Difference]: With dead ends: 217 [2022-07-22 11:08:44,675 INFO L226 Difference]: Without dead ends: 145 [2022-07-22 11:08:44,675 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-22 11:08:44,676 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-22 11:08:44,676 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-22 11:08:44,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-22 11:08:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-07-22 11:08:44,687 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-22 11:08:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2022-07-22 11:08:44,687 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 44 [2022-07-22 11:08:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:44,688 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2022-07-22 11:08:44,688 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-22 11:08:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2022-07-22 11:08:44,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 11:08:44,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:44,688 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-22 11:08:44,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 11:08:44,688 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash -944983075, now seen corresponding path program 1 times [2022-07-22 11:08:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:44,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768204170] [2022-07-22 11:08:44,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:08:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:08:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,748 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-22 11:08:44,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:44,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768204170] [2022-07-22 11:08:44,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768204170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:44,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:44,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 11:08:44,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127928636] [2022-07-22 11:08:44,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:44,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 11:08:44,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:44,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 11:08:44,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 11:08:44,749 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-22 11:08:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:44,836 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2022-07-22 11:08:44,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 11:08:44,836 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-22 11:08:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:44,837 INFO L225 Difference]: With dead ends: 189 [2022-07-22 11:08:44,837 INFO L226 Difference]: Without dead ends: 129 [2022-07-22 11:08:44,837 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-22 11:08:44,837 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:08:44,838 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.1s Time] [2022-07-22 11:08:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-22 11:08:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-22 11:08:44,843 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-22 11:08:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2022-07-22 11:08:44,843 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 48 [2022-07-22 11:08:44,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:44,844 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2022-07-22 11:08:44,844 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-22 11:08:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2022-07-22 11:08:44,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-22 11:08:44,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:44,844 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-22 11:08:44,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 11:08:44,844 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:44,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:44,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1127576207, now seen corresponding path program 1 times [2022-07-22 11:08:44,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:44,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057604098] [2022-07-22 11:08:44,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:44,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:08:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:08:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,881 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-22 11:08:44,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:44,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057604098] [2022-07-22 11:08:44,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057604098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:44,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:44,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 11:08:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835425731] [2022-07-22 11:08:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:44,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:08:44,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:44,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:08:44,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:08:44,882 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-22 11:08:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:44,925 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2022-07-22 11:08:44,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:08:44,926 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-22 11:08:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:44,926 INFO L225 Difference]: With dead ends: 185 [2022-07-22 11:08:44,926 INFO L226 Difference]: Without dead ends: 141 [2022-07-22 11:08:44,926 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-22 11:08:44,927 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-22 11:08:44,927 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-22 11:08:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-22 11:08:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2022-07-22 11:08:44,933 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-22 11:08:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-07-22 11:08:44,933 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 49 [2022-07-22 11:08:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:44,933 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-07-22 11:08:44,933 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-22 11:08:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-07-22 11:08:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-22 11:08:44,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:44,934 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-22 11:08:44,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 11:08:44,934 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1385741645, now seen corresponding path program 1 times [2022-07-22 11:08:44,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:44,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796314306] [2022-07-22 11:08:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:44,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:08:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:08:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:44,989 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-22 11:08:44,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:44,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796314306] [2022-07-22 11:08:44,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796314306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:44,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:44,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 11:08:44,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737056777] [2022-07-22 11:08:44,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:44,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 11:08:44,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:44,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 11:08:44,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:08:44,991 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-22 11:08:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:45,072 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-07-22 11:08:45,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 11:08:45,073 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-22 11:08:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:45,073 INFO L225 Difference]: With dead ends: 138 [2022-07-22 11:08:45,073 INFO L226 Difference]: Without dead ends: 115 [2022-07-22 11:08:45,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-22 11:08:45,074 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-22 11:08:45,074 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-22 11:08:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-22 11:08:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-07-22 11:08:45,079 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-22 11:08:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2022-07-22 11:08:45,079 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 49 [2022-07-22 11:08:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:45,080 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2022-07-22 11:08:45,080 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-22 11:08:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2022-07-22 11:08:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-22 11:08:45,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:45,080 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-22 11:08:45,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 11:08:45,080 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:45,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1173355825, now seen corresponding path program 1 times [2022-07-22 11:08:45,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:45,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284155325] [2022-07-22 11:08:45,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:45,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:08:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:08:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,123 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-22 11:08:45,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:45,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284155325] [2022-07-22 11:08:45,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284155325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:45,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:45,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 11:08:45,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524399533] [2022-07-22 11:08:45,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:45,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:08:45,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:45,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:08:45,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:08:45,124 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-22 11:08:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:45,163 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-07-22 11:08:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:08:45,164 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-22 11:08:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:45,164 INFO L225 Difference]: With dead ends: 136 [2022-07-22 11:08:45,164 INFO L226 Difference]: Without dead ends: 108 [2022-07-22 11:08:45,164 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-22 11:08:45,165 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-22 11:08:45,165 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-22 11:08:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-22 11:08:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-22 11:08:45,169 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-22 11:08:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2022-07-22 11:08:45,170 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 49 [2022-07-22 11:08:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:45,170 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2022-07-22 11:08:45,170 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-22 11:08:45,170 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2022-07-22 11:08:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 11:08:45,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:45,170 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-22 11:08:45,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 11:08:45,170 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:45,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -370766040, now seen corresponding path program 1 times [2022-07-22 11:08:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:45,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221381133] [2022-07-22 11:08:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:08:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:08:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,219 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-22 11:08:45,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:45,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221381133] [2022-07-22 11:08:45,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221381133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:45,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:45,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 11:08:45,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642712830] [2022-07-22 11:08:45,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:45,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 11:08:45,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:45,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 11:08:45,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 11:08:45,220 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-22 11:08:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:45,273 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-07-22 11:08:45,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 11:08:45,273 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-22 11:08:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:45,274 INFO L225 Difference]: With dead ends: 115 [2022-07-22 11:08:45,274 INFO L226 Difference]: Without dead ends: 108 [2022-07-22 11:08:45,274 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-22 11:08:45,274 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-22 11:08:45,274 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-22 11:08:45,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-22 11:08:45,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-22 11:08:45,279 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-22 11:08:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2022-07-22 11:08:45,279 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 50 [2022-07-22 11:08:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:45,279 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2022-07-22 11:08:45,279 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-22 11:08:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-07-22 11:08:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 11:08:45,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:45,280 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-22 11:08:45,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 11:08:45,280 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:45,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1197751707, now seen corresponding path program 1 times [2022-07-22 11:08:45,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:45,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737529473] [2022-07-22 11:08:45,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:45,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:08:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:08:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,340 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-22 11:08:45,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:45,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737529473] [2022-07-22 11:08:45,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737529473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:45,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:45,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 11:08:45,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047115475] [2022-07-22 11:08:45,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:45,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 11:08:45,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:45,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 11:08:45,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 11:08:45,341 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-22 11:08:45,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:45,394 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-07-22 11:08:45,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 11:08:45,394 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-22 11:08:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:45,395 INFO L225 Difference]: With dead ends: 119 [2022-07-22 11:08:45,395 INFO L226 Difference]: Without dead ends: 108 [2022-07-22 11:08:45,395 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-22 11:08:45,395 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.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:08:45,395 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.0s Time] [2022-07-22 11:08:45,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-22 11:08:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-22 11:08:45,400 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-22 11:08:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2022-07-22 11:08:45,401 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 51 [2022-07-22 11:08:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:45,401 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2022-07-22 11:08:45,401 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-22 11:08:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2022-07-22 11:08:45,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 11:08:45,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:45,401 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-22 11:08:45,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 11:08:45,401 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:45,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1206267035, now seen corresponding path program 1 times [2022-07-22 11:08:45,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:08:45,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270447340] [2022-07-22 11:08:45,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:45,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:08:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 11:08:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:08:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:08:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:45,436 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-22 11:08:45,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:08:45,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270447340] [2022-07-22 11:08:45,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270447340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:08:45,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:08:45,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 11:08:45,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151490087] [2022-07-22 11:08:45,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:08:45,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:08:45,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:08:45,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:08:45,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:08:45,437 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-22 11:08:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:45,465 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2022-07-22 11:08:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:08:45,466 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-22 11:08:45,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:45,466 INFO L225 Difference]: With dead ends: 108 [2022-07-22 11:08:45,466 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 11:08:45,467 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-22 11:08:45,467 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-22 11:08:45,467 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-22 11:08:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 11:08:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 11:08:45,468 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-22 11:08:45,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 11:08:45,468 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2022-07-22 11:08:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:45,468 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 11:08:45,468 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-22 11:08:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 11:08:45,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 11:08:45,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:08:45,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 11:08:45,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 11:08:47,491 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-22 11:08:47,491 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-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point KbFilter_CompleteFINAL(lines 618 628) no Hoare annotation was computed. [2022-07-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point KbFilter_CompleteEXIT(lines 618 628) no Hoare annotation was computed. [2022-07-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 656) no Hoare annotation was computed. [2022-07-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point KbFilter_CreateCloseEXIT(lines 629 664) no Hoare annotation was computed. [2022-07-22 11:08:47,492 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-22 11:08:47,492 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-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 655) no Hoare annotation was computed. [2022-07-22 11:08:47,492 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-22 11:08:47,492 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-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point L660-1(line 660) no Hoare annotation was computed. [2022-07-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point KbFilter_CreateCloseFINAL(lines 629 664) no Hoare annotation was computed. [2022-07-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 654) no Hoare annotation was computed. [2022-07-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point L562-1(lines 554 567) no Hoare annotation was computed. [2022-07-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point L558(lines 558 564) no Hoare annotation was computed. [2022-07-22 11:08:47,492 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-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 554 567) no Hoare annotation was computed. [2022-07-22 11:08:47,492 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-22 11:08:47,492 INFO L902 garLoopResultBuilder]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2022-07-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point errorFnFINAL(lines 1009 1016) no Hoare annotation was computed. [2022-07-22 11:08:47,492 INFO L899 garLoopResultBuilder]: For program point errorFnEXIT(lines 1009 1016) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L895 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: false [2022-07-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 459) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L168(lines 168 271) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 282) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L433(lines 433 439) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 984) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 817) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 436) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 409) no Hoare annotation was computed. [2022-07-22 11:08:47,493 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-22 11:08:47,493 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-22 11:08:47,493 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-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 281) no Hoare annotation was computed. [2022-07-22 11:08:47,493 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-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L997-1(line 997) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L931(lines 931 974) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L700(lines 700 729) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L899 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2022-07-22 11:08:47,493 INFO L895 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: false [2022-07-22 11:08:47,493 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-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L734-1(lines 730 736) no Hoare annotation was computed. [2022-07-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 245) no Hoare annotation was computed. [2022-07-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 615) no Hoare annotation was computed. [2022-07-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 342) no Hoare annotation was computed. [2022-07-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L339-2(lines 339 342) no Hoare annotation was computed. [2022-07-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-07-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 280) no Hoare annotation was computed. [2022-07-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 291) no Hoare annotation was computed. [2022-07-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L934(lines 934 973) no Hoare annotation was computed. [2022-07-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L769(lines 769 792) no Hoare annotation was computed. [2022-07-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 728) no Hoare annotation was computed. [2022-07-22 11:08:47,494 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-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 408) no Hoare annotation was computed. [2022-07-22 11:08:47,494 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2022-07-22 11:08:47,495 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-22 11:08:47,495 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-22 11:08:47,495 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-22 11:08:47,495 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-22 11:08:47,495 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-22 11:08:47,495 INFO L899 garLoopResultBuilder]: For program point L903(lines 903 982) no Hoare annotation was computed. [2022-07-22 11:08:47,495 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-22 11:08:47,495 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-22 11:08:47,495 INFO L895 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: false [2022-07-22 11:08:47,496 INFO L899 garLoopResultBuilder]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2022-07-22 11:08:47,496 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 189) no Hoare annotation was computed. [2022-07-22 11:08:47,496 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 279) no Hoare annotation was computed. [2022-07-22 11:08:47,496 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 290) no Hoare annotation was computed. [2022-07-22 11:08:47,496 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-22 11:08:47,496 INFO L899 garLoopResultBuilder]: For program point L1003-1(line 1003) no Hoare annotation was computed. [2022-07-22 11:08:47,496 INFO L899 garLoopResultBuilder]: For program point L706(lines 706 727) no Hoare annotation was computed. [2022-07-22 11:08:47,496 INFO L895 garLoopResultBuilder]: At program point L376(lines 375 408) the Hoare annotation is: (= |ULTIMATE.start_main_~status~1#1| 0) [2022-07-22 11:08:47,496 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-22 11:08:47,496 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2022-07-22 11:08:47,497 INFO L895 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: false [2022-07-22 11:08:47,497 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-22 11:08:47,497 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-22 11:08:47,497 INFO L899 garLoopResultBuilder]: For program point L774(lines 774 791) no Hoare annotation was computed. [2022-07-22 11:08:47,497 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-22 11:08:47,497 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 278) no Hoare annotation was computed. [2022-07-22 11:08:47,497 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 289) no Hoare annotation was computed. [2022-07-22 11:08:47,497 INFO L899 garLoopResultBuilder]: For program point L940(lines 940 943) no Hoare annotation was computed. [2022-07-22 11:08:47,497 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-22 11:08:47,498 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-22 11:08:47,498 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 726) no Hoare annotation was computed. [2022-07-22 11:08:47,498 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: false [2022-07-22 11:08:47,498 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-22 11:08:47,498 INFO L899 garLoopResultBuilder]: For program point L875(lines 875 990) no Hoare annotation was computed. [2022-07-22 11:08:47,498 INFO L899 garLoopResultBuilder]: For program point L809(lines 809 816) no Hoare annotation was computed. [2022-07-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point L380(line 380) no Hoare annotation was computed. [2022-07-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 349) no Hoare annotation was computed. [2022-07-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 188) no Hoare annotation was computed. [2022-07-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 177 189) no Hoare annotation was computed. [2022-07-22 11:08:47,502 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-22 11:08:47,502 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-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point L249-1(line 249) no Hoare annotation was computed. [2022-07-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 277) no Hoare annotation was computed. [2022-07-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 288) no Hoare annotation was computed. [2022-07-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point L910(lines 910 980) no Hoare annotation was computed. [2022-07-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-07-22 11:08:47,502 INFO L895 garLoopResultBuilder]: At program point L184(line 184) the Hoare annotation is: false [2022-07-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 600) no Hoare annotation was computed. [2022-07-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 457) no Hoare annotation was computed. [2022-07-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 11:08:47,502 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-22 11:08:47,502 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 452) no Hoare annotation was computed. [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 276) no Hoare annotation was computed. [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 287) no Hoare annotation was computed. [2022-07-22 11:08:47,503 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-22 11:08:47,503 INFO L895 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: false [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L814-1(lines 793 818) no Hoare annotation was computed. [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L385(line 385) no Hoare annotation was computed. [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 412) no Hoare annotation was computed. [2022-07-22 11:08:47,503 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-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 275) no Hoare annotation was computed. [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 286) no Hoare annotation was computed. [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L883(lines 883 988) no Hoare annotation was computed. [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 456) no Hoare annotation was computed. [2022-07-22 11:08:47,503 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-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 229) no Hoare annotation was computed. [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 978) no Hoare annotation was computed. [2022-07-22 11:08:47,503 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-22 11:08:47,503 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-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-07-22 11:08:47,503 INFO L895 garLoopResultBuilder]: At program point L258(line 258) the Hoare annotation is: false [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 260) no Hoare annotation was computed. [2022-07-22 11:08:47,503 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 274) no Hoare annotation was computed. [2022-07-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 285) no Hoare annotation was computed. [2022-07-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L754(lines 754 766) no Hoare annotation was computed. [2022-07-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L754-1(lines 754 766) no Hoare annotation was computed. [2022-07-22 11:08:47,504 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-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 411) no Hoare annotation was computed. [2022-07-22 11:08:47,504 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-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 11:08:47,504 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-22 11:08:47,504 INFO L895 garLoopResultBuilder]: At program point L227(line 227) the Hoare annotation is: false [2022-07-22 11:08:47,504 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-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L227-1(lines 223 229) no Hoare annotation was computed. [2022-07-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L194-1(lines 194 195) no Hoare annotation was computed. [2022-07-22 11:08:47,504 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-22 11:08:47,504 INFO L895 garLoopResultBuilder]: At program point L756(line 756) the Hoare annotation is: false [2022-07-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L756-1(line 756) no Hoare annotation was computed. [2022-07-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 273) no Hoare annotation was computed. [2022-07-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 284) no Hoare annotation was computed. [2022-07-22 11:08:47,504 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-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L956(lines 956 958) no Hoare annotation was computed. [2022-07-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L956-2(lines 934 971) no Hoare annotation was computed. [2022-07-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L924(lines 924 976) no Hoare annotation was computed. [2022-07-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L891(lines 891 986) no Hoare annotation was computed. [2022-07-22 11:08:47,504 INFO L899 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2022-07-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L594-1(lines 581 600) no Hoare annotation was computed. [2022-07-22 11:08:47,505 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-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 410) no Hoare annotation was computed. [2022-07-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 413) no Hoare annotation was computed. [2022-07-22 11:08:47,505 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-22 11:08:47,505 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-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2022-07-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 272) no Hoare annotation was computed. [2022-07-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 283) no Hoare annotation was computed. [2022-07-22 11:08:47,505 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-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L760(lines 760 764) no Hoare annotation was computed. [2022-07-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L430(lines 414 463) no Hoare annotation was computed. [2022-07-22 11:08:47,505 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-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-07-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2022-07-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L959-1(lines 959 961) no Hoare annotation was computed. [2022-07-22 11:08:47,505 INFO L895 garLoopResultBuilder]: At program point L596(line 596) the Hoare annotation is: false [2022-07-22 11:08:47,505 INFO L902 garLoopResultBuilder]: At program point L464(lines 295 466) the Hoare annotation is: true [2022-07-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 460) no Hoare annotation was computed. [2022-07-22 11:08:47,505 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-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 233 234) no Hoare annotation was computed. [2022-07-22 11:08:47,505 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-22 11:08:47,505 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-22 11:08:47,505 INFO L899 garLoopResultBuilder]: For program point L684-1(line 684) no Hoare annotation was computed. [2022-07-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughFINAL(lines 665 688) no Hoare annotation was computed. [2022-07-22 11:08:47,506 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-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point L678-1(lines 674 680) no Hoare annotation was computed. [2022-07-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughEXIT(lines 665 688) no Hoare annotation was computed. [2022-07-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 680) no Hoare annotation was computed. [2022-07-22 11:08:47,506 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-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point L532(lines 532 549) no Hoare annotation was computed. [2022-07-22 11:08:47,506 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-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2022-07-22 11:08:47,506 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-22 11:08:47,506 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-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point L491-1(line 491) no Hoare annotation was computed. [2022-07-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 481 553) no Hoare annotation was computed. [2022-07-22 11:08:47,506 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-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 548) no Hoare annotation was computed. [2022-07-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point L504(lines 504 527) no Hoare annotation was computed. [2022-07-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 481 553) no Hoare annotation was computed. [2022-07-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point L533(lines 533 539) no Hoare annotation was computed. [2022-07-22 11:08:47,506 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-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point L546-1(lines 528 550) no Hoare annotation was computed. [2022-07-22 11:08:47,506 INFO L899 garLoopResultBuilder]: For program point L509(lines 509 526) no Hoare annotation was computed. [2022-07-22 11:08:47,507 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-22 11:08:47,507 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-22 11:08:47,507 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 501) no Hoare annotation was computed. [2022-07-22 11:08:47,507 INFO L899 garLoopResultBuilder]: For program point L489-1(lines 489 501) no Hoare annotation was computed. [2022-07-22 11:08:47,507 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-22 11:08:47,507 INFO L899 garLoopResultBuilder]: For program point L475-1(lines 467 480) no Hoare annotation was computed. [2022-07-22 11:08:47,507 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-22 11:08:47,519 INFO L899 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 467 480) no Hoare annotation was computed. [2022-07-22 11:08:47,521 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-22 11:08:47,523 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:08:47,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:08:47 BoogieIcfgContainer [2022-07-22 11:08:47,544 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:08:47,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:08:47,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:08:47,545 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:08:47,545 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:08:42" (3/4) ... [2022-07-22 11:08:47,547 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 11:08:47,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2022-07-22 11:08:47,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_CreateClose [2022-07-22 11:08:47,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-07-22 11:08:47,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-07-22 11:08:47,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_DispatchPassThrough [2022-07-22 11:08:47,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-07-22 11:08:47,552 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2022-07-22 11:08:47,561 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2022-07-22 11:08:47,561 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-07-22 11:08:47,562 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-22 11:08:47,563 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 11:08:47,579 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-22 11:08:47,579 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-22 11:08:47,580 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-22 11:08:47,580 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-22 11:08:47,581 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-22 11:08:47,581 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-22 11:08:47,639 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 11:08:47,639 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:08:47,640 INFO L158 Benchmark]: Toolchain (without parser) took 6244.69ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 57.6MB in the beginning and 113.0MB in the end (delta: -55.4MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2022-07-22 11:08:47,640 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:08:47,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.93ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 57.4MB in the beginning and 90.5MB in the end (delta: -33.1MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-07-22 11:08:47,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.34ms. Allocated memory is still 123.7MB. Free memory was 90.5MB in the beginning and 86.7MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 11:08:47,641 INFO L158 Benchmark]: Boogie Preprocessor took 32.22ms. Allocated memory is still 123.7MB. Free memory was 86.7MB in the beginning and 84.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 11:08:47,641 INFO L158 Benchmark]: RCFGBuilder took 557.85ms. Allocated memory is still 123.7MB. Free memory was 84.2MB in the beginning and 48.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-22 11:08:47,641 INFO L158 Benchmark]: TraceAbstraction took 5192.11ms. Allocated memory was 123.7MB in the beginning and 159.4MB in the end (delta: 35.7MB). Free memory was 47.7MB in the beginning and 124.5MB in the end (delta: -76.8MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2022-07-22 11:08:47,641 INFO L158 Benchmark]: Witness Printer took 94.62ms. Allocated memory is still 159.4MB. Free memory was 124.5MB in the beginning and 113.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 11:08:47,642 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.93ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 57.4MB in the beginning and 90.5MB in the end (delta: -33.1MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.34ms. Allocated memory is still 123.7MB. Free memory was 90.5MB in the beginning and 86.7MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.22ms. Allocated memory is still 123.7MB. Free memory was 86.7MB in the beginning and 84.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 557.85ms. Allocated memory is still 123.7MB. Free memory was 84.2MB in the beginning and 48.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5192.11ms. Allocated memory was 123.7MB in the beginning and 159.4MB in the end (delta: 35.7MB). Free memory was 47.7MB in the beginning and 124.5MB in the end (delta: -76.8MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. * Witness Printer took 94.62ms. Allocated memory is still 159.4MB. Free memory was 124.5MB in the beginning and 113.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2706 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2687 mSDsluCounter, 7745 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, 3278 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.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s 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-22 11:08:47,691 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