./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 dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-dbf71c6-m [2022-10-17 10:41:44,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:41:44,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:41:44,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:41:44,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:41:44,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:41:44,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:41:44,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:41:44,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:41:44,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:41:44,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:41:44,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:41:44,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:41:44,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:41:44,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:41:44,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:41:44,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:41:44,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:41:44,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:41:44,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:41:44,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:41:44,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:41:44,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:41:44,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:41:44,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:41:44,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:41:44,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:41:44,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:41:44,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:41:44,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:41:44,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:41:44,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:41:44,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:41:44,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:41:44,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:41:44,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:41:44,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:41:44,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:41:44,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:41:44,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:41:44,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:41:44,478 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:41:44,535 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:41:44,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:41:44,536 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:41:44,537 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:41:44,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:41:44,538 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:41:44,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:41:44,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:41:44,539 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:41:44,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:41:44,541 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:41:44,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:41:44,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:41:44,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:41:44,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:41:44,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:41:44,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:41:44,543 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:41:44,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:41:44,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:41:44,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:41:44,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:41:44,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:41:44,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:41:44,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:41:44,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:41:44,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:41:44,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:41:44,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:41:44,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:41:44,548 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:41:44,548 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:41:44,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:41:44,549 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ 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-10-17 10:41:44,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:41:44,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:41:44,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:41:44,953 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:41:44,953 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:41:44,955 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-10-17 10:41:45,042 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/data/ea2e05548/c00194e21b9542cdad3ec49f00b13a28/FLAGeb5f81f1b [2022-10-17 10:41:45,700 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:41:45,700 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-10-17 10:41:45,715 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/data/ea2e05548/c00194e21b9542cdad3ec49f00b13a28/FLAGeb5f81f1b [2022-10-17 10:41:46,004 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/data/ea2e05548/c00194e21b9542cdad3ec49f00b13a28 [2022-10-17 10:41:46,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:41:46,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:41:46,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:41:46,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:41:46,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:41:46,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2efd946a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46, skipping insertion in model container [2022-10-17 10:41:46,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:41:46,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:41:46,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-10-17 10:41:46,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:41:46,477 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:41:46,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-10-17 10:41:46,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:41:46,621 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:41:46,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46 WrapperNode [2022-10-17 10:41:46,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:41:46,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:41:46,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:41:46,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:41:46,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,719 INFO L138 Inliner]: procedures = 29, calls = 43, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 662 [2022-10-17 10:41:46,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:41:46,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:41:46,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:41:46,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:41:46,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,768 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:41:46,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:41:46,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:41:46,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:41:46,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46" (1/1) ... [2022-10-17 10:41:46,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:41:46,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:41:46,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:41:46,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:41:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:41:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-10-17 10:41:46,888 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-10-17 10:41:46,889 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-10-17 10:41:46,889 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-10-17 10:41:46,889 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-10-17 10:41:46,889 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-10-17 10:41:46,889 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-10-17 10:41:46,890 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-10-17 10:41:46,890 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-10-17 10:41:46,890 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-10-17 10:41:46,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:41:46,891 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-10-17 10:41:46,891 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-10-17 10:41:46,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:41:46,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:41:46,891 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-10-17 10:41:46,892 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-10-17 10:41:47,040 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:41:47,053 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:41:47,230 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-17 10:41:47,240 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-17 10:41:47,256 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-17 10:41:47,280 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-17 10:41:47,284 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-17 10:41:47,900 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-10-17 10:41:47,900 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-10-17 10:41:47,901 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-10-17 10:41:47,901 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-10-17 10:41:47,901 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-10-17 10:41:47,901 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-10-17 10:41:47,902 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-10-17 10:41:47,902 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-10-17 10:41:47,902 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-10-17 10:41:47,903 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-10-17 10:41:47,927 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-17 10:41:47,979 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-10-17 10:41:47,979 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-10-17 10:41:47,994 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:41:48,018 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:41:48,020 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 10:41:48,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:41:48 BoogieIcfgContainer [2022-10-17 10:41:48,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:41:48,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:41:48,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:41:48,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:41:48,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:41:46" (1/3) ... [2022-10-17 10:41:48,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323af40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:41:48, skipping insertion in model container [2022-10-17 10:41:48,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:41:46" (2/3) ... [2022-10-17 10:41:48,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323af40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:41:48, skipping insertion in model container [2022-10-17 10:41:48,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:41:48" (3/3) ... [2022-10-17 10:41:48,038 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2022-10-17 10:41:48,063 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:41:48,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-17 10:41:48,163 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:41:48,177 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@370a7562, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:41:48,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-17 10:41:48,195 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-10-17 10:41:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-17 10:41:48,216 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:48,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:48,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:48,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash -809123790, now seen corresponding path program 1 times [2022-10-17 10:41:48,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:48,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542384854] [2022-10-17 10:41:48,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:48,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:48,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542384854] [2022-10-17 10:41:48,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542384854] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:48,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:48,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:48,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624873578] [2022-10-17 10:41:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:48,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:41:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:48,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:48,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:48,645 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-10-17 10:41:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:48,813 INFO L93 Difference]: Finished difference Result 338 states and 529 transitions. [2022-10-17 10:41:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:48,816 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-10-17 10:41:48,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:48,830 INFO L225 Difference]: With dead ends: 338 [2022-10-17 10:41:48,830 INFO L226 Difference]: Without dead ends: 198 [2022-10-17 10:41:48,837 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-10-17 10:41:48,841 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.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:48,842 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.1s Time] [2022-10-17 10:41:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-10-17 10:41:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-10-17 10:41:48,907 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-10-17 10:41:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2022-10-17 10:41:48,913 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 13 [2022-10-17 10:41:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:48,914 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2022-10-17 10:41:48,914 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-10-17 10:41:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2022-10-17 10:41:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-17 10:41:48,916 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:48,917 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-10-17 10:41:48,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:41:48,917 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:48,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash 900719787, now seen corresponding path program 1 times [2022-10-17 10:41:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:48,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387723743] [2022-10-17 10:41:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:48,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:49,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387723743] [2022-10-17 10:41:49,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387723743] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:49,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:49,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:49,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135436645] [2022-10-17 10:41:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:49,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:41:49,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:49,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:49,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:49,114 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-10-17 10:41:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:49,315 INFO L93 Difference]: Finished difference Result 314 states and 449 transitions. [2022-10-17 10:41:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:49,316 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-10-17 10:41:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:49,325 INFO L225 Difference]: With dead ends: 314 [2022-10-17 10:41:49,325 INFO L226 Difference]: Without dead ends: 262 [2022-10-17 10:41:49,331 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-10-17 10:41:49,334 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 201 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:49,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 428 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:41:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-10-17 10:41:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 249. [2022-10-17 10:41:49,400 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-10-17 10:41:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 357 transitions. [2022-10-17 10:41:49,403 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 357 transitions. Word has length 19 [2022-10-17 10:41:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:49,404 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 357 transitions. [2022-10-17 10:41:49,404 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-10-17 10:41:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 357 transitions. [2022-10-17 10:41:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-17 10:41:49,406 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:49,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:49,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:41:49,406 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:49,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043530, now seen corresponding path program 1 times [2022-10-17 10:41:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:49,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280316037] [2022-10-17 10:41:49,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:49,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:49,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280316037] [2022-10-17 10:41:49,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280316037] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:49,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:49,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:49,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434007138] [2022-10-17 10:41:49,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:49,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:41:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:49,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:49,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:49,510 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-10-17 10:41:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:49,565 INFO L93 Difference]: Finished difference Result 402 states and 557 transitions. [2022-10-17 10:41:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:49,566 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-10-17 10:41:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:49,570 INFO L225 Difference]: With dead ends: 402 [2022-10-17 10:41:49,571 INFO L226 Difference]: Without dead ends: 306 [2022-10-17 10:41:49,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:49,582 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-10-17 10:41:49,583 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-10-17 10:41:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-10-17 10:41:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 287. [2022-10-17 10:41:49,623 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-10-17 10:41:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 406 transitions. [2022-10-17 10:41:49,628 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 406 transitions. Word has length 18 [2022-10-17 10:41:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:49,629 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 406 transitions. [2022-10-17 10:41:49,629 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-10-17 10:41:49,629 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 406 transitions. [2022-10-17 10:41:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-17 10:41:49,639 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:49,640 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-10-17 10:41:49,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:41:49,640 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:49,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2086831099, now seen corresponding path program 1 times [2022-10-17 10:41:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:49,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639573616] [2022-10-17 10:41:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:49,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639573616] [2022-10-17 10:41:49,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639573616] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:49,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:49,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:41:49,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133002346] [2022-10-17 10:41:49,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:49,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:41:49,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:49,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:41:49,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:41:49,810 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-10-17 10:41:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:49,898 INFO L93 Difference]: Finished difference Result 290 states and 408 transitions. [2022-10-17 10:41:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:41:49,899 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-10-17 10:41:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:49,904 INFO L225 Difference]: With dead ends: 290 [2022-10-17 10:41:49,904 INFO L226 Difference]: Without dead ends: 286 [2022-10-17 10:41:49,906 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-10-17 10:41:49,912 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.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:49,914 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.1s Time] [2022-10-17 10:41:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-10-17 10:41:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-10-17 10:41:49,943 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-10-17 10:41:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 403 transitions. [2022-10-17 10:41:49,947 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 403 transitions. Word has length 29 [2022-10-17 10:41:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:49,948 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 403 transitions. [2022-10-17 10:41:49,949 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-10-17 10:41:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 403 transitions. [2022-10-17 10:41:49,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-17 10:41:49,952 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:49,952 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-10-17 10:41:49,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:41:49,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:49,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:49,954 INFO L85 PathProgramCache]: Analyzing trace with hash -507734156, now seen corresponding path program 1 times [2022-10-17 10:41:49,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:49,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952401902] [2022-10-17 10:41:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:50,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:50,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:50,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952401902] [2022-10-17 10:41:50,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952401902] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:50,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:50,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:41:50,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436083760] [2022-10-17 10:41:50,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:50,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:41:50,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:50,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:41:50,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:41:50,193 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-10-17 10:41:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:50,436 INFO L93 Difference]: Finished difference Result 308 states and 427 transitions. [2022-10-17 10:41:50,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:41:50,437 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-10-17 10:41:50,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:50,440 INFO L225 Difference]: With dead ends: 308 [2022-10-17 10:41:50,440 INFO L226 Difference]: Without dead ends: 303 [2022-10-17 10:41:50,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-17 10:41:50,441 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.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:50,442 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.2s Time] [2022-10-17 10:41:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-10-17 10:41:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2022-10-17 10:41:50,475 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-10-17 10:41:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 415 transitions. [2022-10-17 10:41:50,478 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 415 transitions. Word has length 33 [2022-10-17 10:41:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:50,478 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 415 transitions. [2022-10-17 10:41:50,479 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-10-17 10:41:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 415 transitions. [2022-10-17 10:41:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-17 10:41:50,481 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:50,481 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-10-17 10:41:50,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:41:50,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:50,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1061247362, now seen corresponding path program 1 times [2022-10-17 10:41:50,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:50,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358466243] [2022-10-17 10:41:50,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:50,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:50,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:50,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:50,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358466243] [2022-10-17 10:41:50,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358466243] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:50,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:50,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:41:50,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494804342] [2022-10-17 10:41:50,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:50,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:41:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:50,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:41:50,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:41:50,646 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-10-17 10:41:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:50,895 INFO L93 Difference]: Finished difference Result 308 states and 426 transitions. [2022-10-17 10:41:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:41:50,895 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-10-17 10:41:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:50,899 INFO L225 Difference]: With dead ends: 308 [2022-10-17 10:41:50,899 INFO L226 Difference]: Without dead ends: 303 [2022-10-17 10:41:50,899 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-10-17 10:41:50,900 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.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:50,901 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.2s Time] [2022-10-17 10:41:50,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-10-17 10:41:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2022-10-17 10:41:50,944 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-10-17 10:41:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 416 transitions. [2022-10-17 10:41:50,947 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 416 transitions. Word has length 34 [2022-10-17 10:41:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:50,948 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 416 transitions. [2022-10-17 10:41:50,948 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-10-17 10:41:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 416 transitions. [2022-10-17 10:41:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-17 10:41:50,950 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:50,951 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-10-17 10:41:50,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:41:50,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:50,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:50,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1403318816, now seen corresponding path program 1 times [2022-10-17 10:41:50,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:50,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657594046] [2022-10-17 10:41:50,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:50,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:51,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:51,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:51,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657594046] [2022-10-17 10:41:51,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657594046] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:51,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:51,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:41:51,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645626949] [2022-10-17 10:41:51,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:51,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:41:51,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:51,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:41:51,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:41:51,037 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-10-17 10:41:51,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:51,263 INFO L93 Difference]: Finished difference Result 336 states and 455 transitions. [2022-10-17 10:41:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:41:51,264 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-10-17 10:41:51,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:51,267 INFO L225 Difference]: With dead ends: 336 [2022-10-17 10:41:51,267 INFO L226 Difference]: Without dead ends: 278 [2022-10-17 10:41:51,267 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-10-17 10:41:51,269 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.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:51,269 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.2s Time] [2022-10-17 10:41:51,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-10-17 10:41:51,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 264. [2022-10-17 10:41:51,306 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-10-17 10:41:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 365 transitions. [2022-10-17 10:41:51,308 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 365 transitions. Word has length 34 [2022-10-17 10:41:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:51,309 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 365 transitions. [2022-10-17 10:41:51,309 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-10-17 10:41:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 365 transitions. [2022-10-17 10:41:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-17 10:41:51,314 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:51,314 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-10-17 10:41:51,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:41:51,315 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817110, now seen corresponding path program 1 times [2022-10-17 10:41:51,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:51,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248875569] [2022-10-17 10:41:51,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:51,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:51,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:51,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248875569] [2022-10-17 10:41:51,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248875569] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:51,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:51,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 10:41:51,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656940798] [2022-10-17 10:41:51,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:51,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 10:41:51,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:51,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 10:41:51,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 10:41:51,423 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-10-17 10:41:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:51,596 INFO L93 Difference]: Finished difference Result 317 states and 429 transitions. [2022-10-17 10:41:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 10:41:51,597 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-10-17 10:41:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:51,600 INFO L225 Difference]: With dead ends: 317 [2022-10-17 10:41:51,600 INFO L226 Difference]: Without dead ends: 282 [2022-10-17 10:41:51,601 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-10-17 10:41:51,601 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-10-17 10:41:51,602 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-10-17 10:41:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-10-17 10:41:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 264. [2022-10-17 10:41:51,635 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-10-17 10:41:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 363 transitions. [2022-10-17 10:41:51,637 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 363 transitions. Word has length 34 [2022-10-17 10:41:51,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:51,638 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 363 transitions. [2022-10-17 10:41:51,638 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-10-17 10:41:51,638 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 363 transitions. [2022-10-17 10:41:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-17 10:41:51,640 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:51,640 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-10-17 10:41:51,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:41:51,640 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:51,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1671852310, now seen corresponding path program 1 times [2022-10-17 10:41:51,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:51,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445687543] [2022-10-17 10:41:51,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:51,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:51,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:51,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:51,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445687543] [2022-10-17 10:41:51,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445687543] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:51,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:51,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 10:41:51,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072495041] [2022-10-17 10:41:51,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:51,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 10:41:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:51,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 10:41:51,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 10:41:51,712 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-10-17 10:41:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:51,844 INFO L93 Difference]: Finished difference Result 278 states and 380 transitions. [2022-10-17 10:41:51,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 10:41:51,845 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-10-17 10:41:51,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:51,846 INFO L225 Difference]: With dead ends: 278 [2022-10-17 10:41:51,846 INFO L226 Difference]: Without dead ends: 82 [2022-10-17 10:41:51,847 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-10-17 10:41:51,850 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 285 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:51,850 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.1s Time] [2022-10-17 10:41:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-17 10:41:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-10-17 10:41:51,863 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-10-17 10:41:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2022-10-17 10:41:51,865 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 35 [2022-10-17 10:41:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:51,865 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2022-10-17 10:41:51,866 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-10-17 10:41:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2022-10-17 10:41:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-17 10:41:51,867 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:51,868 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-10-17 10:41:51,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 10:41:51,868 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:51,869 INFO L85 PathProgramCache]: Analyzing trace with hash 965976384, now seen corresponding path program 1 times [2022-10-17 10:41:51,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:51,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440822225] [2022-10-17 10:41:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:51,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:51,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-17 10:41:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:51,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-17 10:41:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:51,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:51,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440822225] [2022-10-17 10:41:51,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440822225] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:51,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:51,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:41:51,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521738178] [2022-10-17 10:41:51,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:51,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:41:51,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:51,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:41:51,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:41:51,957 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-10-17 10:41:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:52,040 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-10-17 10:41:52,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:41:52,040 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-10-17 10:41:52,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:52,043 INFO L225 Difference]: With dead ends: 106 [2022-10-17 10:41:52,044 INFO L226 Difference]: Without dead ends: 80 [2022-10-17 10:41:52,044 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-10-17 10:41:52,045 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.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:52,046 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.1s Time] [2022-10-17 10:41:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-17 10:41:52,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-10-17 10:41:52,057 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-10-17 10:41:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2022-10-17 10:41:52,058 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 39 [2022-10-17 10:41:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:52,058 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2022-10-17 10:41:52,059 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-10-17 10:41:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-10-17 10:41:52,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-17 10:41:52,060 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:52,060 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-10-17 10:41:52,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-17 10:41:52,060 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:52,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:52,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1309646071, now seen corresponding path program 1 times [2022-10-17 10:41:52,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:52,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125751053] [2022-10-17 10:41:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:52,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:41:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:52,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:52,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125751053] [2022-10-17 10:41:52,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125751053] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:52,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:52,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:41:52,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532554630] [2022-10-17 10:41:52,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:52,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:41:52,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:52,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:41:52,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:41:52,246 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-10-17 10:41:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:52,369 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2022-10-17 10:41:52,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 10:41:52,369 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-10-17 10:41:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:52,372 INFO L225 Difference]: With dead ends: 126 [2022-10-17 10:41:52,372 INFO L226 Difference]: Without dead ends: 91 [2022-10-17 10:41:52,373 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-10-17 10:41:52,374 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:52,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 395 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:41:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-10-17 10:41:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2022-10-17 10:41:52,402 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-10-17 10:41:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-10-17 10:41:52,403 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 41 [2022-10-17 10:41:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:52,404 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-10-17 10:41:52,404 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-10-17 10:41:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-10-17 10:41:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-17 10:41:52,405 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:52,405 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-10-17 10:41:52,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 10:41:52,406 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:52,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1579777203, now seen corresponding path program 1 times [2022-10-17 10:41:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:52,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091544687] [2022-10-17 10:41:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:52,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:52,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:52,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:41:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:52,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:52,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091544687] [2022-10-17 10:41:52,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091544687] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:52,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:52,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:41:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032198113] [2022-10-17 10:41:52,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:52,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:41:52,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:52,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:41:52,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:41:52,592 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-10-17 10:41:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:52,720 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-10-17 10:41:52,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 10:41:52,721 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-10-17 10:41:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:52,722 INFO L225 Difference]: With dead ends: 96 [2022-10-17 10:41:52,722 INFO L226 Difference]: Without dead ends: 89 [2022-10-17 10:41:52,722 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-10-17 10:41:52,724 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:52,724 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.1s Time] [2022-10-17 10:41:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-17 10:41:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-10-17 10:41:52,734 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-10-17 10:41:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2022-10-17 10:41:52,735 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 43 [2022-10-17 10:41:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:52,737 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2022-10-17 10:41:52,737 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-10-17 10:41:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2022-10-17 10:41:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-17 10:41:52,738 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:52,738 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-10-17 10:41:52,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-17 10:41:52,739 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:52,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1941659704, now seen corresponding path program 1 times [2022-10-17 10:41:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:52,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890386524] [2022-10-17 10:41:52,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:52,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:52,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:52,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:41:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:52,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:52,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:52,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890386524] [2022-10-17 10:41:52,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890386524] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:52,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:52,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:41:52,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318897728] [2022-10-17 10:41:52,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:52,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:41:52,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:52,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:41:52,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:41:52,853 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-10-17 10:41:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:52,920 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2022-10-17 10:41:52,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:41:52,921 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-10-17 10:41:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:52,922 INFO L225 Difference]: With dead ends: 102 [2022-10-17 10:41:52,922 INFO L226 Difference]: Without dead ends: 97 [2022-10-17 10:41:52,922 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-10-17 10:41:52,924 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-10-17 10:41:52,924 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-10-17 10:41:52,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-10-17 10:41:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2022-10-17 10:41:52,936 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-10-17 10:41:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2022-10-17 10:41:52,937 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 42 [2022-10-17 10:41:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:52,937 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2022-10-17 10:41:52,937 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-10-17 10:41:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2022-10-17 10:41:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-17 10:41:52,938 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:52,938 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-10-17 10:41:52,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-17 10:41:52,939 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:52,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash 598103956, now seen corresponding path program 1 times [2022-10-17 10:41:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:52,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916850745] [2022-10-17 10:41:52,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:41:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:53,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:53,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916850745] [2022-10-17 10:41:53,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916850745] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:53,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:53,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:41:53,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857512659] [2022-10-17 10:41:53,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:53,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:41:53,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:53,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:41:53,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:41:53,029 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-10-17 10:41:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:53,131 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2022-10-17 10:41:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:41:53,132 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-10-17 10:41:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:53,133 INFO L225 Difference]: With dead ends: 174 [2022-10-17 10:41:53,133 INFO L226 Difference]: Without dead ends: 167 [2022-10-17 10:41:53,134 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-10-17 10:41:53,134 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 54 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:53,135 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.1s Time] [2022-10-17 10:41:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-10-17 10:41:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2022-10-17 10:41:53,156 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-10-17 10:41:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2022-10-17 10:41:53,158 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 44 [2022-10-17 10:41:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:53,159 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2022-10-17 10:41:53,159 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-10-17 10:41:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2022-10-17 10:41:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-17 10:41:53,160 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:53,160 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-10-17 10:41:53,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-17 10:41:53,161 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:53,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:53,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1921855978, now seen corresponding path program 1 times [2022-10-17 10:41:53,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:53,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447972207] [2022-10-17 10:41:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:41:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:53,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:53,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447972207] [2022-10-17 10:41:53,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447972207] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:53,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:53,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:41:53,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971273272] [2022-10-17 10:41:53,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:53,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:41:53,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:53,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:41:53,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:41:53,369 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-10-17 10:41:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:53,457 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2022-10-17 10:41:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:41:53,458 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-10-17 10:41:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:53,459 INFO L225 Difference]: With dead ends: 217 [2022-10-17 10:41:53,459 INFO L226 Difference]: Without dead ends: 145 [2022-10-17 10:41:53,460 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-10-17 10:41:53,461 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.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:53,461 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.1s Time] [2022-10-17 10:41:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-10-17 10:41:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-10-17 10:41:53,482 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-10-17 10:41:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2022-10-17 10:41:53,483 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 44 [2022-10-17 10:41:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:53,483 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2022-10-17 10:41:53,483 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-10-17 10:41:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2022-10-17 10:41:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-17 10:41:53,484 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:53,485 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-10-17 10:41:53,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-17 10:41:53,485 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:53,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:53,486 INFO L85 PathProgramCache]: Analyzing trace with hash -944983075, now seen corresponding path program 1 times [2022-10-17 10:41:53,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:53,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027403129] [2022-10-17 10:41:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:41:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-17 10:41:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:53,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027403129] [2022-10-17 10:41:53,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027403129] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:53,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:53,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-17 10:41:53,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473119003] [2022-10-17 10:41:53,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:53,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 10:41:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:53,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 10:41:53,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-10-17 10:41:53,653 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-10-17 10:41:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:53,815 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2022-10-17 10:41:53,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 10:41:53,815 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-10-17 10:41:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:53,817 INFO L225 Difference]: With dead ends: 189 [2022-10-17 10:41:53,817 INFO L226 Difference]: Without dead ends: 129 [2022-10-17 10:41:53,817 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-10-17 10:41:53,818 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 81 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-10-17 10:41:53,818 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-10-17 10:41:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-10-17 10:41:53,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-10-17 10:41:53,839 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-10-17 10:41:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2022-10-17 10:41:53,841 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 48 [2022-10-17 10:41:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:53,841 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2022-10-17 10:41:53,841 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-10-17 10:41:53,842 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2022-10-17 10:41:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-17 10:41:53,842 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:53,843 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-10-17 10:41:53,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-17 10:41:53,843 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:53,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1127576207, now seen corresponding path program 1 times [2022-10-17 10:41:53,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:53,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705994554] [2022-10-17 10:41:53,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:53,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:41:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-17 10:41:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:53,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:53,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705994554] [2022-10-17 10:41:53,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705994554] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:53,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:53,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:41:53,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243916238] [2022-10-17 10:41:53,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:53,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:41:53,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:53,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:41:53,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:41:53,957 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-10-17 10:41:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:54,047 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2022-10-17 10:41:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:41:54,047 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-10-17 10:41:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:54,049 INFO L225 Difference]: With dead ends: 185 [2022-10-17 10:41:54,049 INFO L226 Difference]: Without dead ends: 141 [2022-10-17 10:41:54,049 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-10-17 10:41:54,050 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:54,050 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.1s Time] [2022-10-17 10:41:54,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-10-17 10:41:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2022-10-17 10:41:54,072 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-10-17 10:41:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-10-17 10:41:54,073 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 49 [2022-10-17 10:41:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:54,073 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-10-17 10:41:54,074 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-10-17 10:41:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-10-17 10:41:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-17 10:41:54,075 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:54,075 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-10-17 10:41:54,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-17 10:41:54,075 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:54,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1385741645, now seen corresponding path program 1 times [2022-10-17 10:41:54,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:54,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672985461] [2022-10-17 10:41:54,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:54,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:54,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:41:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:54,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-17 10:41:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:54,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:54,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672985461] [2022-10-17 10:41:54,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672985461] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:54,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:54,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:41:54,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433507462] [2022-10-17 10:41:54,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:54,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:41:54,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:54,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:41:54,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:41:54,241 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-10-17 10:41:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:54,383 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-10-17 10:41:54,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:41:54,384 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-10-17 10:41:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:54,385 INFO L225 Difference]: With dead ends: 138 [2022-10-17 10:41:54,385 INFO L226 Difference]: Without dead ends: 115 [2022-10-17 10:41:54,385 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-10-17 10:41:54,386 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 116 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:54,387 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.1s Time] [2022-10-17 10:41:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-10-17 10:41:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-10-17 10:41:54,407 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-10-17 10:41:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2022-10-17 10:41:54,408 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 49 [2022-10-17 10:41:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:54,408 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2022-10-17 10:41:54,408 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-10-17 10:41:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2022-10-17 10:41:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-17 10:41:54,409 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:54,410 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-10-17 10:41:54,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-17 10:41:54,410 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:54,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1173355825, now seen corresponding path program 1 times [2022-10-17 10:41:54,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:54,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941305147] [2022-10-17 10:41:54,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:54,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:54,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:54,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:41:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:54,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-17 10:41:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:54,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941305147] [2022-10-17 10:41:54,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941305147] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:54,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:54,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:41:54,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961221997] [2022-10-17 10:41:54,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:54,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:41:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:54,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:41:54,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:41:54,497 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-10-17 10:41:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:54,606 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-10-17 10:41:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:41:54,606 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-10-17 10:41:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:54,607 INFO L225 Difference]: With dead ends: 136 [2022-10-17 10:41:54,608 INFO L226 Difference]: Without dead ends: 108 [2022-10-17 10:41:54,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-17 10:41:54,609 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:54,609 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.1s Time] [2022-10-17 10:41:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-17 10:41:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-10-17 10:41:54,632 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-10-17 10:41:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2022-10-17 10:41:54,633 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 49 [2022-10-17 10:41:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:54,634 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2022-10-17 10:41:54,634 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-10-17 10:41:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2022-10-17 10:41:54,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-17 10:41:54,635 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:54,635 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-10-17 10:41:54,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-17 10:41:54,636 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:54,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:54,636 INFO L85 PathProgramCache]: Analyzing trace with hash -370766040, now seen corresponding path program 1 times [2022-10-17 10:41:54,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:54,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289411990] [2022-10-17 10:41:54,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:54,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:54,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:54,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:41:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:54,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-17 10:41:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:54,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289411990] [2022-10-17 10:41:54,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289411990] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:54,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:54,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-17 10:41:54,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237073229] [2022-10-17 10:41:54,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:54,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 10:41:54,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:54,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 10:41:54,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-10-17 10:41:54,793 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-10-17 10:41:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:54,904 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-10-17 10:41:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:41:54,904 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-10-17 10:41:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:54,905 INFO L225 Difference]: With dead ends: 115 [2022-10-17 10:41:54,906 INFO L226 Difference]: Without dead ends: 108 [2022-10-17 10:41:54,906 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-10-17 10:41:54,907 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:54,907 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.1s Time] [2022-10-17 10:41:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-17 10:41:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-10-17 10:41:54,926 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-10-17 10:41:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2022-10-17 10:41:54,927 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 50 [2022-10-17 10:41:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:54,928 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2022-10-17 10:41:54,928 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-10-17 10:41:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-10-17 10:41:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-17 10:41:54,929 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:54,929 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-10-17 10:41:54,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-17 10:41:54,930 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:54,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:54,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1197751707, now seen corresponding path program 1 times [2022-10-17 10:41:54,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:54,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920769000] [2022-10-17 10:41:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:55,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:55,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:41:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:55,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-17 10:41:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:55,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-10-17 10:41:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:55,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920769000] [2022-10-17 10:41:55,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920769000] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:55,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:55,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-17 10:41:55,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022447724] [2022-10-17 10:41:55,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:55,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 10:41:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:55,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 10:41:55,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-10-17 10:41:55,125 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-10-17 10:41:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:55,232 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-10-17 10:41:55,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:41:55,232 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-10-17 10:41:55,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:55,234 INFO L225 Difference]: With dead ends: 119 [2022-10-17 10:41:55,234 INFO L226 Difference]: Without dead ends: 108 [2022-10-17 10:41:55,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:41:55,235 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:41:55,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 287 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:41:55,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-17 10:41:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-10-17 10:41:55,255 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-10-17 10:41:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2022-10-17 10:41:55,257 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 51 [2022-10-17 10:41:55,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:55,257 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2022-10-17 10:41:55,257 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-10-17 10:41:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2022-10-17 10:41:55,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-17 10:41:55,258 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:41:55,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:41:55,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-17 10:41:55,259 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:41:55,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:41:55,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1206267035, now seen corresponding path program 1 times [2022-10-17 10:41:55,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:41:55,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229888198] [2022-10-17 10:41:55,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:41:55,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:41:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:55,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-17 10:41:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:41:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:55,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-17 10:41:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:41:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:41:55,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:41:55,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229888198] [2022-10-17 10:41:55,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229888198] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:41:55,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:41:55,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:41:55,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12158810] [2022-10-17 10:41:55,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:41:55,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:41:55,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:41:55,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:41:55,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:41:55,350 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-10-17 10:41:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:41:55,415 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2022-10-17 10:41:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:41:55,416 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-10-17 10:41:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:41:55,416 INFO L225 Difference]: With dead ends: 108 [2022-10-17 10:41:55,416 INFO L226 Difference]: Without dead ends: 0 [2022-10-17 10:41:55,417 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-10-17 10:41:55,418 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-10-17 10:41:55,418 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-10-17 10:41:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-17 10:41:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-17 10:41:55,419 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-10-17 10:41:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-17 10:41:55,419 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2022-10-17 10:41:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:41:55,419 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-17 10:41:55,420 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-10-17 10:41:55,420 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-17 10:41:55,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-17 10:41:55,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-17 10:41:55,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-17 10:41:55,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-17 10:41:58,739 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-10-17 10:41:58,739 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-10-17 10:41:58,739 INFO L899 garLoopResultBuilder]: For program point KbFilter_CompleteFINAL(lines 618 628) no Hoare annotation was computed. [2022-10-17 10:41:58,739 INFO L899 garLoopResultBuilder]: For program point KbFilter_CompleteEXIT(lines 618 628) no Hoare annotation was computed. [2022-10-17 10:41:58,739 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 656) no Hoare annotation was computed. [2022-10-17 10:41:58,740 INFO L899 garLoopResultBuilder]: For program point KbFilter_CreateCloseEXIT(lines 629 664) no Hoare annotation was computed. [2022-10-17 10:41:58,740 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-10-17 10:41:58,740 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-10-17 10:41:58,741 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 655) no Hoare annotation was computed. [2022-10-17 10:41:58,741 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-10-17 10:41:58,741 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-10-17 10:41:58,741 INFO L899 garLoopResultBuilder]: For program point L660-1(line 660) no Hoare annotation was computed. [2022-10-17 10:41:58,741 INFO L899 garLoopResultBuilder]: For program point KbFilter_CreateCloseFINAL(lines 629 664) no Hoare annotation was computed. [2022-10-17 10:41:58,742 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 654) no Hoare annotation was computed. [2022-10-17 10:41:58,742 INFO L899 garLoopResultBuilder]: For program point L562-1(lines 554 567) no Hoare annotation was computed. [2022-10-17 10:41:58,742 INFO L899 garLoopResultBuilder]: For program point L558(lines 558 564) no Hoare annotation was computed. [2022-10-17 10:41:58,742 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-10-17 10:41:58,743 INFO L899 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 554 567) no Hoare annotation was computed. [2022-10-17 10:41:58,743 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-10-17 10:41:58,743 INFO L902 garLoopResultBuilder]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2022-10-17 10:41:58,743 INFO L899 garLoopResultBuilder]: For program point errorFnFINAL(lines 1009 1016) no Hoare annotation was computed. [2022-10-17 10:41:58,743 INFO L899 garLoopResultBuilder]: For program point errorFnEXIT(lines 1009 1016) no Hoare annotation was computed. [2022-10-17 10:41:58,744 INFO L899 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2022-10-17 10:41:58,744 INFO L895 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: false [2022-10-17 10:41:58,744 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 459) no Hoare annotation was computed. [2022-10-17 10:41:58,744 INFO L899 garLoopResultBuilder]: For program point L168(lines 168 271) no Hoare annotation was computed. [2022-10-17 10:41:58,744 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 282) no Hoare annotation was computed. [2022-10-17 10:41:58,744 INFO L899 garLoopResultBuilder]: For program point L433(lines 433 439) no Hoare annotation was computed. [2022-10-17 10:41:58,745 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 984) no Hoare annotation was computed. [2022-10-17 10:41:58,745 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 817) no Hoare annotation was computed. [2022-10-17 10:41:58,745 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 436) no Hoare annotation was computed. [2022-10-17 10:41:58,745 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 409) no Hoare annotation was computed. [2022-10-17 10:41:58,745 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-10-17 10:41:58,745 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-10-17 10:41:58,746 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-10-17 10:41:58,746 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 281) no Hoare annotation was computed. [2022-10-17 10:41:58,746 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-10-17 10:41:58,746 INFO L899 garLoopResultBuilder]: For program point L997-1(line 997) no Hoare annotation was computed. [2022-10-17 10:41:58,746 INFO L899 garLoopResultBuilder]: For program point L931(lines 931 974) no Hoare annotation was computed. [2022-10-17 10:41:58,747 INFO L899 garLoopResultBuilder]: For program point L700(lines 700 729) no Hoare annotation was computed. [2022-10-17 10:41:58,747 INFO L899 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2022-10-17 10:41:58,747 INFO L895 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: false [2022-10-17 10:41:58,747 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-10-17 10:41:58,747 INFO L899 garLoopResultBuilder]: For program point L734-1(lines 730 736) no Hoare annotation was computed. [2022-10-17 10:41:58,747 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 245) no Hoare annotation was computed. [2022-10-17 10:41:58,748 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 615) no Hoare annotation was computed. [2022-10-17 10:41:58,748 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 342) no Hoare annotation was computed. [2022-10-17 10:41:58,748 INFO L899 garLoopResultBuilder]: For program point L339-2(lines 339 342) no Hoare annotation was computed. [2022-10-17 10:41:58,748 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-10-17 10:41:58,748 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 280) no Hoare annotation was computed. [2022-10-17 10:41:58,748 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 291) no Hoare annotation was computed. [2022-10-17 10:41:58,748 INFO L899 garLoopResultBuilder]: For program point L934(lines 934 973) no Hoare annotation was computed. [2022-10-17 10:41:58,749 INFO L899 garLoopResultBuilder]: For program point L769(lines 769 792) no Hoare annotation was computed. [2022-10-17 10:41:58,749 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 728) no Hoare annotation was computed. [2022-10-17 10:41:58,749 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-10-17 10:41:58,749 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 408) no Hoare annotation was computed. [2022-10-17 10:41:58,749 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2022-10-17 10:41:58,750 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-10-17 10:41:58,750 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-10-17 10:41:58,750 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-10-17 10:41:58,750 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-10-17 10:41:58,751 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-10-17 10:41:58,751 INFO L899 garLoopResultBuilder]: For program point L903(lines 903 982) no Hoare annotation was computed. [2022-10-17 10:41:58,751 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-10-17 10:41:58,751 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-10-17 10:41:58,751 INFO L895 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: false [2022-10-17 10:41:58,751 INFO L899 garLoopResultBuilder]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2022-10-17 10:41:58,752 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 189) no Hoare annotation was computed. [2022-10-17 10:41:58,752 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 279) no Hoare annotation was computed. [2022-10-17 10:41:58,752 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 290) no Hoare annotation was computed. [2022-10-17 10:41:58,752 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-10-17 10:41:58,752 INFO L899 garLoopResultBuilder]: For program point L1003-1(line 1003) no Hoare annotation was computed. [2022-10-17 10:41:58,752 INFO L899 garLoopResultBuilder]: For program point L706(lines 706 727) no Hoare annotation was computed. [2022-10-17 10:41:58,753 INFO L895 garLoopResultBuilder]: At program point L376(lines 375 408) the Hoare annotation is: (= |ULTIMATE.start_main_~status~1#1| 0) [2022-10-17 10:41:58,753 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-10-17 10:41:58,753 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2022-10-17 10:41:58,753 INFO L895 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: false [2022-10-17 10:41:58,753 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-10-17 10:41:58,754 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-10-17 10:41:58,754 INFO L899 garLoopResultBuilder]: For program point L774(lines 774 791) no Hoare annotation was computed. [2022-10-17 10:41:58,754 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-10-17 10:41:58,754 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 278) no Hoare annotation was computed. [2022-10-17 10:41:58,754 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 289) no Hoare annotation was computed. [2022-10-17 10:41:58,755 INFO L899 garLoopResultBuilder]: For program point L940(lines 940 943) no Hoare annotation was computed. [2022-10-17 10:41:58,755 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-10-17 10:41:58,755 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-10-17 10:41:58,755 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 726) no Hoare annotation was computed. [2022-10-17 10:41:58,755 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: false [2022-10-17 10:41:58,756 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-10-17 10:41:58,756 INFO L899 garLoopResultBuilder]: For program point L875(lines 875 990) no Hoare annotation was computed. [2022-10-17 10:41:58,756 INFO L899 garLoopResultBuilder]: For program point L809(lines 809 816) no Hoare annotation was computed. [2022-10-17 10:41:58,756 INFO L899 garLoopResultBuilder]: For program point L380(line 380) no Hoare annotation was computed. [2022-10-17 10:41:58,756 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 349) no Hoare annotation was computed. [2022-10-17 10:41:58,756 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 188) no Hoare annotation was computed. [2022-10-17 10:41:58,756 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 177 189) no Hoare annotation was computed. [2022-10-17 10:41:58,757 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-10-17 10:41:58,757 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-10-17 10:41:58,757 INFO L899 garLoopResultBuilder]: For program point L249-1(line 249) no Hoare annotation was computed. [2022-10-17 10:41:58,757 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 277) no Hoare annotation was computed. [2022-10-17 10:41:58,757 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 288) no Hoare annotation was computed. [2022-10-17 10:41:58,758 INFO L899 garLoopResultBuilder]: For program point L910(lines 910 980) no Hoare annotation was computed. [2022-10-17 10:41:58,758 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-10-17 10:41:58,758 INFO L895 garLoopResultBuilder]: At program point L184(line 184) the Hoare annotation is: false [2022-10-17 10:41:58,758 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 600) no Hoare annotation was computed. [2022-10-17 10:41:58,758 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 457) no Hoare annotation was computed. [2022-10-17 10:41:58,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-17 10:41:58,759 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-10-17 10:41:58,759 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2022-10-17 10:41:58,759 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 452) no Hoare annotation was computed. [2022-10-17 10:41:58,759 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 276) no Hoare annotation was computed. [2022-10-17 10:41:58,759 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 287) no Hoare annotation was computed. [2022-10-17 10:41:58,759 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-10-17 10:41:58,760 INFO L895 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: false [2022-10-17 10:41:58,760 INFO L899 garLoopResultBuilder]: For program point L814-1(lines 793 818) no Hoare annotation was computed. [2022-10-17 10:41:58,760 INFO L899 garLoopResultBuilder]: For program point L385(line 385) no Hoare annotation was computed. [2022-10-17 10:41:58,760 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 412) no Hoare annotation was computed. [2022-10-17 10:41:58,760 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-10-17 10:41:58,760 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 275) no Hoare annotation was computed. [2022-10-17 10:41:58,761 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 286) no Hoare annotation was computed. [2022-10-17 10:41:58,761 INFO L899 garLoopResultBuilder]: For program point L883(lines 883 988) no Hoare annotation was computed. [2022-10-17 10:41:58,761 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 456) no Hoare annotation was computed. [2022-10-17 10:41:58,761 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-10-17 10:41:58,761 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-17 10:41:58,761 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 229) no Hoare annotation was computed. [2022-10-17 10:41:58,762 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 978) no Hoare annotation was computed. [2022-10-17 10:41:58,762 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-10-17 10:41:58,762 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-10-17 10:41:58,762 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-10-17 10:41:58,762 INFO L895 garLoopResultBuilder]: At program point L258(line 258) the Hoare annotation is: false [2022-10-17 10:41:58,763 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 260) no Hoare annotation was computed. [2022-10-17 10:41:58,763 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 274) no Hoare annotation was computed. [2022-10-17 10:41:58,763 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 285) no Hoare annotation was computed. [2022-10-17 10:41:58,763 INFO L899 garLoopResultBuilder]: For program point L754(lines 754 766) no Hoare annotation was computed. [2022-10-17 10:41:58,763 INFO L899 garLoopResultBuilder]: For program point L754-1(lines 754 766) no Hoare annotation was computed. [2022-10-17 10:41:58,763 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 (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~MPR3~0 ~s~0))) [2022-10-17 10:41:58,764 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 411) no Hoare annotation was computed. [2022-10-17 10:41:58,764 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-10-17 10:41:58,764 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-17 10:41:58,764 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-10-17 10:41:58,764 INFO L895 garLoopResultBuilder]: At program point L227(line 227) the Hoare annotation is: false [2022-10-17 10:41:58,765 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-10-17 10:41:58,765 INFO L899 garLoopResultBuilder]: For program point L227-1(lines 223 229) no Hoare annotation was computed. [2022-10-17 10:41:58,765 INFO L899 garLoopResultBuilder]: For program point L194-1(lines 194 195) no Hoare annotation was computed. [2022-10-17 10:41:58,765 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-10-17 10:41:58,765 INFO L895 garLoopResultBuilder]: At program point L756(line 756) the Hoare annotation is: false [2022-10-17 10:41:58,765 INFO L899 garLoopResultBuilder]: For program point L756-1(line 756) no Hoare annotation was computed. [2022-10-17 10:41:58,766 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 273) no Hoare annotation was computed. [2022-10-17 10:41:58,766 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 284) no Hoare annotation was computed. [2022-10-17 10:41:58,766 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-10-17 10:41:58,766 INFO L899 garLoopResultBuilder]: For program point L956(lines 956 958) no Hoare annotation was computed. [2022-10-17 10:41:58,766 INFO L899 garLoopResultBuilder]: For program point L956-2(lines 934 971) no Hoare annotation was computed. [2022-10-17 10:41:58,766 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-17 10:41:58,767 INFO L899 garLoopResultBuilder]: For program point L924(lines 924 976) no Hoare annotation was computed. [2022-10-17 10:41:58,767 INFO L899 garLoopResultBuilder]: For program point L891(lines 891 986) no Hoare annotation was computed. [2022-10-17 10:41:58,767 INFO L899 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2022-10-17 10:41:58,767 INFO L899 garLoopResultBuilder]: For program point L594-1(lines 581 600) no Hoare annotation was computed. [2022-10-17 10:41:58,767 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-10-17 10:41:58,767 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 410) no Hoare annotation was computed. [2022-10-17 10:41:58,768 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 413) no Hoare annotation was computed. [2022-10-17 10:41:58,768 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-10-17 10:41:58,768 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-10-17 10:41:58,768 INFO L899 garLoopResultBuilder]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2022-10-17 10:41:58,768 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 272) no Hoare annotation was computed. [2022-10-17 10:41:58,768 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 283) no Hoare annotation was computed. [2022-10-17 10:41:58,769 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-10-17 10:41:58,769 INFO L899 garLoopResultBuilder]: For program point L760(lines 760 764) no Hoare annotation was computed. [2022-10-17 10:41:58,769 INFO L899 garLoopResultBuilder]: For program point L430(lines 414 463) no Hoare annotation was computed. [2022-10-17 10:41:58,769 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-10-17 10:41:58,769 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-10-17 10:41:58,769 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2022-10-17 10:41:58,770 INFO L899 garLoopResultBuilder]: For program point L959-1(lines 959 961) no Hoare annotation was computed. [2022-10-17 10:41:58,770 INFO L895 garLoopResultBuilder]: At program point L596(line 596) the Hoare annotation is: false [2022-10-17 10:41:58,770 INFO L902 garLoopResultBuilder]: At program point L464(lines 295 466) the Hoare annotation is: true [2022-10-17 10:41:58,770 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 460) no Hoare annotation was computed. [2022-10-17 10:41:58,770 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-10-17 10:41:58,771 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 233 234) no Hoare annotation was computed. [2022-10-17 10:41:58,771 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-10-17 10:41:58,771 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-10-17 10:41:58,771 INFO L899 garLoopResultBuilder]: For program point L684-1(line 684) no Hoare annotation was computed. [2022-10-17 10:41:58,771 INFO L899 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughFINAL(lines 665 688) no Hoare annotation was computed. [2022-10-17 10:41:58,771 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-10-17 10:41:58,772 INFO L899 garLoopResultBuilder]: For program point L678-1(lines 674 680) no Hoare annotation was computed. [2022-10-17 10:41:58,772 INFO L899 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughEXIT(lines 665 688) no Hoare annotation was computed. [2022-10-17 10:41:58,772 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 680) no Hoare annotation was computed. [2022-10-17 10:41:58,772 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) (and (< 0 (+ 1073741803 IofCallDriver_~__cil_tmp7~0)) (<= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~MPR1~0 ~s~0)) (not (= ~NP~0 1)) (not .cse2) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse3 .cse4 (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)))) [2022-10-17 10:41:58,773 INFO L899 garLoopResultBuilder]: For program point L532(lines 532 549) no Hoare annotation was computed. [2022-10-17 10:41:58,773 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-10-17 10:41:58,773 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2022-10-17 10:41:58,773 INFO L895 garLoopResultBuilder]: At program point L524(lines 488 552) the Hoare annotation is: (let ((.cse1 (= ~pended~0 1)) (.cse2 (= ~SKIP2~0 2)) (.cse0 (= ~NP~0 |old(~s~0)|)) (.cse3 (= ~IPC~0 2)) (.cse7 (not (= 2 ~DC~0)))) (and (let ((.cse4 (< 0 (+ 1073741803 IofCallDriver_~__cil_tmp7~0))) (.cse5 (<= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (.cse6 (= ~MPR1~0 ~s~0))) (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not .cse0) .cse1 (not (<= 5 ~MPR1~0)) .cse2 .cse3 (and (= IofCallDriver_~returnVal2~0 0) .cse4 .cse5 .cse6) .cse7 (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) .cse4 (<= 259 IofCallDriver_~returnVal2~0) .cse5 .cse6) (not (= ~compRegistered~0 1)) (= ~MPR3~0 1) (and (<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0) .cse4 .cse5 .cse6))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse0 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse7))) [2022-10-17 10:41:58,774 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-10-17 10:41:58,774 INFO L899 garLoopResultBuilder]: For program point L491-1(line 491) no Hoare annotation was computed. [2022-10-17 10:41:58,774 INFO L899 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 481 553) no Hoare annotation was computed. [2022-10-17 10:41:58,774 INFO L895 garLoopResultBuilder]: At program point L512(lines 511 526) 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)) (not .cse0) .cse1 (not (<= 5 ~MPR1~0)) .cse2 .cse3 (and (= ~setEventCalled~0 1) (< 0 (+ 1073741803 IofCallDriver_~__cil_tmp7~0)) (<= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~MPR1~0 ~s~0)) .cse4 (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse0 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-10-17 10:41:58,775 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 548) no Hoare annotation was computed. [2022-10-17 10:41:58,775 INFO L899 garLoopResultBuilder]: For program point L504(lines 504 527) no Hoare annotation was computed. [2022-10-17 10:41:58,775 INFO L899 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 481 553) no Hoare annotation was computed. [2022-10-17 10:41:58,775 INFO L899 garLoopResultBuilder]: For program point L533(lines 533 539) no Hoare annotation was computed. [2022-10-17 10:41:58,775 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-10-17 10:41:58,775 INFO L899 garLoopResultBuilder]: For program point L546-1(lines 528 550) no Hoare annotation was computed. [2022-10-17 10:41:58,776 INFO L899 garLoopResultBuilder]: For program point L509(lines 509 526) no Hoare annotation was computed. [2022-10-17 10:41:58,776 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) (and (< 0 (+ 1073741803 IofCallDriver_~__cil_tmp7~0)) (<= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~MPR1~0 ~s~0)) (not (= ~NP~0 1)) (not .cse2) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse3 .cse4 (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)))) [2022-10-17 10:41:58,776 INFO L895 garLoopResultBuilder]: At program point L497(line 497) 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 (and (= ~setEventCalled~0 1) (< 0 (+ 1073741803 IofCallDriver_~__cil_tmp7~0)) (<= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~s~0 |old(~s~0)|)) .cse4 (not (= ~compRegistered~0 1)) (= ~MPR3~0 1)))) [2022-10-17 10:41:58,776 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 501) no Hoare annotation was computed. [2022-10-17 10:41:58,777 INFO L899 garLoopResultBuilder]: For program point L489-1(lines 489 501) no Hoare annotation was computed. [2022-10-17 10:41:58,777 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-10-17 10:41:58,777 INFO L899 garLoopResultBuilder]: For program point L475-1(lines 467 480) no Hoare annotation was computed. [2022-10-17 10:41:58,777 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-10-17 10:41:58,777 INFO L899 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 467 480) no Hoare annotation was computed. [2022-10-17 10:41:58,781 INFO L444 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-10-17 10:41:58,783 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 10:41:58,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 10:41:58 BoogieIcfgContainer [2022-10-17 10:41:58,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 10:41:58,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:41:58,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:41:58,834 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:41:58,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:41:48" (3/4) ... [2022-10-17 10:41:58,838 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-10-17 10:41:58,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2022-10-17 10:41:58,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_CreateClose [2022-10-17 10:41:58,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-10-17 10:41:58,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-10-17 10:41:58,847 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_DispatchPassThrough [2022-10-17 10:41:58,847 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-10-17 10:41:58,847 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2022-10-17 10:41:58,866 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2022-10-17 10:41:58,868 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-10-17 10:41:58,870 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-10-17 10:41:58,872 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-10-17 10:41:58,905 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 || ((0 < 1073741803 + __cil_tmp7 && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || IPC == 2) || !(2 == DC)) || !(compRegistered == 1)) || MPR3 == 1) [2022-10-17 10:41:58,906 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || IPC == 2) || (((returnVal2 == 0 && 0 < 1073741803 + __cil_tmp7) && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(2 == DC)) || (((((setEventCalled == 1 && returnVal2 <= 259) && 0 < 1073741803 + __cil_tmp7) && 259 <= returnVal2) && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(compRegistered == 1)) || MPR3 == 1) || (((1073741823 + returnVal2 <= 0 && 0 < 1073741803 + __cil_tmp7) && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) && (((((((((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)) [2022-10-17 10:41:58,907 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 || ((0 < 1073741803 + __cil_tmp7 && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || IPC == 2) || !(2 == DC)) || !(compRegistered == 1)) || MPR3 == 1) [2022-10-17 10:41:58,907 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || IPC == 2) || (((setEventCalled == 1 && 0 < 1073741803 + __cil_tmp7) && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(2 == DC)) || !(compRegistered == 1)) || MPR3 == 1) && (((((((((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)) [2022-10-17 10:41:58,909 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-10-17 10:41:58,910 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-10-17 10:41:58,993 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:41:58,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:41:58,994 INFO L158 Benchmark]: Toolchain (without parser) took 12986.26ms. Allocated memory was 113.2MB in the beginning and 230.7MB in the end (delta: 117.4MB). Free memory was 67.6MB in the beginning and 76.9MB in the end (delta: -9.2MB). Peak memory consumption was 107.9MB. Max. memory is 16.1GB. [2022-10-17 10:41:58,995 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory was 84.4MB in the beginning and 84.3MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:41:58,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.29ms. Allocated memory is still 113.2MB. Free memory was 67.4MB in the beginning and 76.9MB in the end (delta: -9.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-10-17 10:41:58,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.83ms. Allocated memory is still 113.2MB. Free memory was 76.6MB in the beginning and 73.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:41:58,996 INFO L158 Benchmark]: Boogie Preprocessor took 58.60ms. Allocated memory is still 113.2MB. Free memory was 73.1MB in the beginning and 70.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 10:41:58,997 INFO L158 Benchmark]: RCFGBuilder took 1244.75ms. Allocated memory was 113.2MB in the beginning and 146.8MB in the end (delta: 33.6MB). Free memory was 70.3MB in the beginning and 106.4MB in the end (delta: -36.2MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2022-10-17 10:41:58,997 INFO L158 Benchmark]: TraceAbstraction took 10804.50ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 105.6MB in the beginning and 88.4MB in the end (delta: 17.2MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. [2022-10-17 10:41:58,997 INFO L158 Benchmark]: Witness Printer took 160.00ms. Allocated memory is still 230.7MB. Free memory was 88.4MB in the beginning and 76.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-10-17 10:41:59,000 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.32ms. Allocated memory is still 113.2MB. Free memory was 84.4MB in the beginning and 84.3MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.29ms. Allocated memory is still 113.2MB. Free memory was 67.4MB in the beginning and 76.9MB in the end (delta: -9.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.83ms. Allocated memory is still 113.2MB. Free memory was 76.6MB in the beginning and 73.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.60ms. Allocated memory is still 113.2MB. Free memory was 73.1MB in the beginning and 70.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1244.75ms. Allocated memory was 113.2MB in the beginning and 146.8MB in the end (delta: 33.6MB). Free memory was 70.3MB in the beginning and 106.4MB in the end (delta: -36.2MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10804.50ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 105.6MB in the beginning and 88.4MB in the end (delta: 17.2MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. * Witness Printer took 160.00ms. Allocated memory is still 230.7MB. Free memory was 88.4MB in the beginning and 76.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 208 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2706 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2687 mSDsluCounter, 7747 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4467 mSDsCounter, 382 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1647 IncrementalHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 382 mSolverCounterUnsat, 3280 mSDtfsCounter, 1647 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s 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.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 111 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 274 PreInvPairs, 354 NumberOfFragments, 2573 HoareAnnotationTreeSize, 274 FomulaSimplifications, 248 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 76 FomulaSimplificationsInter, 3132 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 856 NumberOfCodeBlocks, 856 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 2126 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 || ((0 < 1073741803 + __cil_tmp7 && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || 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) && !(pended == 1)) && !(IPC == 2)) && s == NP) && !(SKIP1 == NP)) && status == 0) && !(MPR3 == s) - 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: ((((((((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || IPC == 2) || (((returnVal2 == 0 && 0 < 1073741803 + __cil_tmp7) && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(2 == DC)) || (((((setEventCalled == 1 && returnVal2 <= 259) && 0 < 1073741803 + __cil_tmp7) && 259 <= returnVal2) && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(compRegistered == 1)) || MPR3 == 1) || (((1073741823 + returnVal2 <= 0 && 0 < 1073741803 + __cil_tmp7) && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) && (((((((((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)) - 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: ((((((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || IPC == 2) || (((setEventCalled == 1 && 0 < 1073741803 + __cil_tmp7) && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(2 == DC)) || !(compRegistered == 1)) || MPR3 == 1) && (((((((((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)) - 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 || ((0 < 1073741803 + __cil_tmp7 && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || SKIP2 == 2) || 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-10-17 10:41:59,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95c70af-0b9e-4069-ace6-695a93557280/bin/uautomizer-J5u9QxTXDZ/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