./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 64bit --witnessprinter.graph.data.programhash 1ef83f89a2480bb974b27f067785c3859d21a1e764735321272ad8be1e6dccbd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 15:19:18,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:19:18,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 15:19:18,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:19:18,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:19:18,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:19:18,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:19:18,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:19:18,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:19:18,528 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:19:18,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:19:18,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:19:18,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:19:18,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:19:18,530 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:19:18,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:19:18,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:19:18,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:19:18,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:19:18,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:19:18,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:19:18,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:19:18,537 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:19:18,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:19:18,537 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:19:18,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:19:18,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:19:18,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:19:18,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:19:18,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:19:18,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:19:18,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:19:18,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:19:18,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:19:18,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:19:18,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:19:18,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:19:18,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:19:18,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:19:18,543 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ef83f89a2480bb974b27f067785c3859d21a1e764735321272ad8be1e6dccbd [2024-10-11 15:19:18,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:19:18,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:19:18,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:19:18,818 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:19:18,819 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:19:18,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2024-10-11 15:19:20,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:19:20,631 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:19:20,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2024-10-11 15:19:20,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/75c380b2f/d05c041d687c494c9548fa4b8d01c85e/FLAGb8d4a5889 [2024-10-11 15:19:20,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/75c380b2f/d05c041d687c494c9548fa4b8d01c85e [2024-10-11 15:19:20,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:19:20,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:19:20,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:19:20,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:19:20,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:19:20,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:19:20" (1/1) ... [2024-10-11 15:19:20,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a4d2a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:20, skipping insertion in model container [2024-10-11 15:19:20,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:19:20" (1/1) ... [2024-10-11 15:19:20,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:19:21,888 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i[133672,133685] [2024-10-11 15:19:21,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:19:22,068 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:19:22,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [3073] [2024-10-11 15:19:22,201 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3087-3088] [2024-10-11 15:19:22,207 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3102] [2024-10-11 15:19:22,207 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3105] [2024-10-11 15:19:22,207 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3108] [2024-10-11 15:19:22,207 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3111] [2024-10-11 15:19:22,209 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& kernel_stack)); [3173] [2024-10-11 15:19:22,209 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3176] [2024-10-11 15:19:22,210 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3179] [2024-10-11 15:19:22,210 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3182] [2024-10-11 15:19:22,337 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i[133672,133685] [2024-10-11 15:19:22,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:19:22,403 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:19:22,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22 WrapperNode [2024-10-11 15:19:22,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:19:22,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:19:22,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:19:22,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:19:22,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (1/1) ... [2024-10-11 15:19:22,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (1/1) ... [2024-10-11 15:19:22,615 INFO L138 Inliner]: procedures = 191, calls = 831, calls flagged for inlining = 89, calls inlined = 75, statements flattened = 2352 [2024-10-11 15:19:22,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:19:22,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:19:22,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:19:22,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:19:22,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (1/1) ... [2024-10-11 15:19:22,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (1/1) ... [2024-10-11 15:19:22,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (1/1) ... [2024-10-11 15:19:22,833 INFO L175 MemorySlicer]: Split 434 memory accesses to 14 slices as follows [2, 1, 34, 7, 7, 7, 113, 2, 9, 8, 5, 3, 234, 2]. 54 percent of accesses are in the largest equivalence class. The 66 initializations are split as follows [2, 0, 34, 7, 7, 7, 0, 0, 9, 0, 0, 0, 0, 0]. The 143 writes are split as follows [0, 0, 0, 0, 0, 0, 103, 0, 0, 1, 5, 0, 34, 0]. [2024-10-11 15:19:22,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (1/1) ... [2024-10-11 15:19:22,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (1/1) ... [2024-10-11 15:19:22,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (1/1) ... [2024-10-11 15:19:22,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (1/1) ... [2024-10-11 15:19:22,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (1/1) ... [2024-10-11 15:19:22,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (1/1) ... [2024-10-11 15:19:23,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:19:23,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:19:23,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:19:23,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:19:23,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (1/1) ... [2024-10-11 15:19:23,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:19:23,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:19:23,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 15:19:23,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 15:19:23,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-11 15:19:23,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-11 15:19:23,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-11 15:19:23,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-11 15:19:23,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-11 15:19:23,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-11 15:19:23,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-11 15:19:23,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-11 15:19:23,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-11 15:19:23,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-11 15:19:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-10-11 15:19:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2024-10-11 15:19:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2024-10-11 15:19:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2024-10-11 15:19:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure input_event_size [2024-10-11 15:19:23,100 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event_size [2024-10-11 15:19:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-11 15:19:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-11 15:19:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-11 15:19:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-11 15:19:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-11 15:19:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-11 15:19:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-11 15:19:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-11 15:19:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-10-11 15:19:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-10-11 15:19:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2024-10-11 15:19:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2024-10-11 15:19:23,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2024-10-11 15:19:23,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2024-10-11 15:19:23,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-11 15:19:23,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-11 15:19:23,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-11 15:19:23,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-11 15:19:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-11 15:19:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-11 15:19:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-11 15:19:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-11 15:19:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-10-11 15:19:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-10-11 15:19:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-10-11 15:19:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2024-10-11 15:19:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2024-10-11 15:19:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2024-10-11 15:19:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 15:19:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 15:19:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 15:19:23,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 15:19:23,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 15:19:23,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 15:19:23,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 15:19:23,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 15:19:23,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 15:19:23,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 15:19:23,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 15:19:23,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 15:19:23,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 15:19:23,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 15:19:23,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2024-10-11 15:19:23,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2024-10-11 15:19:23,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-10-11 15:19:23,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-10-11 15:19:23,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2024-10-11 15:19:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2024-10-11 15:19:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2024-10-11 15:19:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2024-10-11 15:19:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2024-10-11 15:19:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2024-10-11 15:19:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2024-10-11 15:19:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2024-10-11 15:19:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2024-10-11 15:19:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2024-10-11 15:19:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2024-10-11 15:19:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2024-10-11 15:19:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-10-11 15:19:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-10-11 15:19:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2024-10-11 15:19:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2024-10-11 15:19:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2024-10-11 15:19:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2024-10-11 15:19:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2024-10-11 15:19:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2024-10-11 15:19:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2024-10-11 15:19:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2024-10-11 15:19:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2024-10-11 15:19:23,112 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2024-10-11 15:19:23,112 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2024-10-11 15:19:23,112 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2024-10-11 15:19:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2024-10-11 15:19:23,112 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2024-10-11 15:19:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2024-10-11 15:19:23,113 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2024-10-11 15:19:23,113 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_request_done [2024-10-11 15:19:23,113 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_request_done [2024-10-11 15:19:23,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:19:23,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:19:23,113 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2024-10-11 15:19:23,114 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2024-10-11 15:19:23,114 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 15:19:23,114 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 15:19:23,114 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_flat [2024-10-11 15:19:23,114 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_flat [2024-10-11 15:19:23,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 15:19:23,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 15:19:23,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 15:19:23,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 15:19:23,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 15:19:23,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 15:19:23,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 15:19:23,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 15:19:23,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 15:19:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 15:19:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 15:19:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 15:19:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 15:19:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 15:19:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2024-10-11 15:19:23,116 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2024-10-11 15:19:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2024-10-11 15:19:23,116 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2024-10-11 15:19:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:19:23,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:19:23,117 INFO L130 BoogieDeclarations]: Found specification of procedure input_alloc_absinfo [2024-10-11 15:19:23,117 INFO L138 BoogieDeclarations]: Found implementation of procedure input_alloc_absinfo [2024-10-11 15:19:23,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2024-10-11 15:19:23,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2024-10-11 15:19:23,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-11 15:19:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-11 15:19:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_request_find [2024-10-11 15:19:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_request_find [2024-10-11 15:19:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_uinput_device [2024-10-11 15:19:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_uinput_device [2024-10-11 15:19:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:19:23,119 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_allocate_device [2024-10-11 15:19:23,119 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_allocate_device [2024-10-11 15:19:23,119 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2024-10-11 15:19:23,119 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2024-10-11 15:19:23,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:19:23,119 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_ioctl_handler [2024-10-11 15:19:23,120 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_ioctl_handler [2024-10-11 15:19:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:19:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:19:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:19:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 15:19:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 15:19:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 15:19:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 15:19:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 15:19:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 15:19:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 15:19:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-11 15:19:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-11 15:19:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-11 15:19:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-11 15:19:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:19:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_ff_upload_from_user [2024-10-11 15:19:23,122 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_ff_upload_from_user [2024-10-11 15:19:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_destroy_device [2024-10-11 15:19:23,122 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_destroy_device [2024-10-11 15:19:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:19:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:19:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:19:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:19:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:19:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:19:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 15:19:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 15:19:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 15:19:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 15:19:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-11 15:19:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-11 15:19:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-11 15:19:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-11 15:19:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_max [2024-10-11 15:19:23,125 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_max [2024-10-11 15:19:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2024-10-11 15:19:23,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2024-10-11 15:19:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2024-10-11 15:19:23,125 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2024-10-11 15:19:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2024-10-11 15:19:23,126 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2024-10-11 15:19:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2024-10-11 15:19:23,126 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2024-10-11 15:19:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_min [2024-10-11 15:19:23,126 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_min [2024-10-11 15:19:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:19:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:19:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:19:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:19:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:19:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:19:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:19:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 15:19:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 15:19:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 15:19:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 15:19:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-11 15:19:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-11 15:19:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-11 15:19:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-11 15:19:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure is_compat_task [2024-10-11 15:19:23,128 INFO L138 BoogieDeclarations]: Found implementation of procedure is_compat_task [2024-10-11 15:19:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2024-10-11 15:19:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2024-10-11 15:19:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait [2024-10-11 15:19:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait [2024-10-11 15:19:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-11 15:19:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-11 15:19:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-10-11 15:19:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-10-11 15:19:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2024-10-11 15:19:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2024-10-11 15:19:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2024-10-11 15:19:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2024-10-11 15:19:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2024-10-11 15:19:23,130 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2024-10-11 15:19:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2024-10-11 15:19:23,130 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2024-10-11 15:19:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:19:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:19:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:19:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 15:19:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 15:19:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 15:19:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 15:19:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 15:19:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 15:19:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 15:19:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 15:19:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 15:19:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 15:19:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 15:19:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2024-10-11 15:19:23,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2024-10-11 15:19:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2024-10-11 15:19:23,133 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2024-10-11 15:19:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-11 15:19:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-11 15:19:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-11 15:19:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-11 15:19:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-11 15:19:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-11 15:19:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-11 15:19:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-11 15:19:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-10-11 15:19:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-10-11 15:19:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2024-10-11 15:19:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2024-10-11 15:19:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2024-10-11 15:19:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2024-10-11 15:19:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2024-10-11 15:19:23,135 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2024-10-11 15:19:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2024-10-11 15:19:23,136 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2024-10-11 15:19:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:19:23,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:19:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-10-11 15:19:23,136 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-10-11 15:19:23,686 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:19:23,689 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:19:34,477 INFO L? ?]: Removed 1208 outVars from TransFormulas that were not future-live. [2024-10-11 15:19:34,477 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:19:34,597 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:19:34,597 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 15:19:34,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:19:34 BoogieIcfgContainer [2024-10-11 15:19:34,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:19:34,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:19:34,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:19:34,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:19:34,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:19:20" (1/3) ... [2024-10-11 15:19:34,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324b7901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:19:34, skipping insertion in model container [2024-10-11 15:19:34,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:22" (2/3) ... [2024-10-11 15:19:34,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324b7901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:19:34, skipping insertion in model container [2024-10-11 15:19:34,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:19:34" (3/3) ... [2024-10-11 15:19:34,606 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2024-10-11 15:19:34,621 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:19:34,622 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 15:19:34,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:19:34,726 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@192a5480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:19:34,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 15:19:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 623 states, 436 states have (on average 1.4426605504587156) internal successors, (629), 450 states have internal predecessors, (629), 140 states have call successors, (140), 43 states have call predecessors, (140), 43 states have return successors, (140), 138 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-11 15:19:34,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 15:19:34,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:34,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:34,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:34,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:34,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1899068000, now seen corresponding path program 1 times [2024-10-11 15:19:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:34,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953658146] [2024-10-11 15:19:34,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:34,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:35,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 15:19:35,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953658146] [2024-10-11 15:19:35,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953658146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:35,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:35,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 15:19:35,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593531058] [2024-10-11 15:19:35,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:35,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:19:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:35,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:19:35,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:19:35,211 INFO L87 Difference]: Start difference. First operand has 623 states, 436 states have (on average 1.4426605504587156) internal successors, (629), 450 states have internal predecessors, (629), 140 states have call successors, (140), 43 states have call predecessors, (140), 43 states have return successors, (140), 138 states have call predecessors, (140), 140 states have call successors, (140) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-10-11 15:19:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:35,544 INFO L93 Difference]: Finished difference Result 1240 states and 1840 transitions. [2024-10-11 15:19:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:19:35,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 10 [2024-10-11 15:19:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:35,570 INFO L225 Difference]: With dead ends: 1240 [2024-10-11 15:19:35,571 INFO L226 Difference]: Without dead ends: 619 [2024-10-11 15:19:35,582 INFO L431 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 [2024-10-11 15:19:35,587 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 890 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:35,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 821 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:19:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-10-11 15:19:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2024-10-11 15:19:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 435 states have (on average 1.4229885057471265) internal successors, (619), 446 states have internal predecessors, (619), 139 states have call successors, (139), 43 states have call predecessors, (139), 42 states have return successors, (135), 133 states have call predecessors, (135), 135 states have call successors, (135) [2024-10-11 15:19:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 893 transitions. [2024-10-11 15:19:35,715 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 893 transitions. Word has length 10 [2024-10-11 15:19:35,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:35,717 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 893 transitions. [2024-10-11 15:19:35,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-10-11 15:19:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 893 transitions. [2024-10-11 15:19:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 15:19:35,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:35,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:35,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:19:35,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:35,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:35,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1258154451, now seen corresponding path program 1 times [2024-10-11 15:19:35,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:35,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210180116] [2024-10-11 15:19:35,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:35,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:35,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 15:19:35,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:35,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210180116] [2024-10-11 15:19:35,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210180116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:35,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:35,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 15:19:35,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991800581] [2024-10-11 15:19:35,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:35,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:19:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:35,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:19:35,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:19:35,843 INFO L87 Difference]: Start difference. First operand 619 states and 893 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-11 15:19:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:36,086 INFO L93 Difference]: Finished difference Result 621 states and 894 transitions. [2024-10-11 15:19:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:19:36,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2024-10-11 15:19:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:36,092 INFO L225 Difference]: With dead ends: 621 [2024-10-11 15:19:36,092 INFO L226 Difference]: Without dead ends: 618 [2024-10-11 15:19:36,093 INFO L431 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 [2024-10-11 15:19:36,094 INFO L432 NwaCegarLoop]: 818 mSDtfsCounter, 885 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:36,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 818 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:19:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-10-11 15:19:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2024-10-11 15:19:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 435 states have (on average 1.4206896551724137) internal successors, (618), 445 states have internal predecessors, (618), 138 states have call successors, (138), 43 states have call predecessors, (138), 42 states have return successors, (135), 133 states have call predecessors, (135), 135 states have call successors, (135) [2024-10-11 15:19:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 891 transitions. [2024-10-11 15:19:36,143 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 891 transitions. Word has length 11 [2024-10-11 15:19:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:36,143 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 891 transitions. [2024-10-11 15:19:36,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-11 15:19:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 891 transitions. [2024-10-11 15:19:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 15:19:36,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:36,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:36,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:19:36,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:36,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash 347807491, now seen corresponding path program 1 times [2024-10-11 15:19:36,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:36,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120859862] [2024-10-11 15:19:36,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:36,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:36,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 15:19:36,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:36,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120859862] [2024-10-11 15:19:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120859862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:36,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 15:19:36,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768210703] [2024-10-11 15:19:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:36,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:19:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:36,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:19:36,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:19:36,243 INFO L87 Difference]: Start difference. First operand 618 states and 891 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-11 15:19:36,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:36,684 INFO L93 Difference]: Finished difference Result 1797 states and 2610 transitions. [2024-10-11 15:19:36,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:19:36,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2024-10-11 15:19:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:36,695 INFO L225 Difference]: With dead ends: 1797 [2024-10-11 15:19:36,696 INFO L226 Difference]: Without dead ends: 1177 [2024-10-11 15:19:36,699 INFO L431 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 [2024-10-11 15:19:36,700 INFO L432 NwaCegarLoop]: 1324 mSDtfsCounter, 879 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:36,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 2077 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 15:19:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2024-10-11 15:19:36,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1170. [2024-10-11 15:19:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 829 states have (on average 1.4185765983112184) internal successors, (1176), 845 states have internal predecessors, (1176), 260 states have call successors, (260), 80 states have call predecessors, (260), 78 states have return successors, (264), 250 states have call predecessors, (264), 254 states have call successors, (264) [2024-10-11 15:19:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1700 transitions. [2024-10-11 15:19:36,790 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1700 transitions. Word has length 12 [2024-10-11 15:19:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:36,791 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1700 transitions. [2024-10-11 15:19:36,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-11 15:19:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1700 transitions. [2024-10-11 15:19:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 15:19:36,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:36,793 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:36,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 15:19:36,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:36,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:36,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1822675842, now seen corresponding path program 1 times [2024-10-11 15:19:36,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:36,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205507197] [2024-10-11 15:19:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:36,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:36,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:36,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:19:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 15:19:36,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:36,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205507197] [2024-10-11 15:19:36,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205507197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:36,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:36,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 15:19:36,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653143227] [2024-10-11 15:19:36,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:36,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:19:36,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:36,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:19:36,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:19:36,917 INFO L87 Difference]: Start difference. First operand 1170 states and 1700 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 15:19:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:37,266 INFO L93 Difference]: Finished difference Result 2401 states and 3506 transitions. [2024-10-11 15:19:37,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:19:37,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 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 26 [2024-10-11 15:19:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:37,274 INFO L225 Difference]: With dead ends: 2401 [2024-10-11 15:19:37,275 INFO L226 Difference]: Without dead ends: 1235 [2024-10-11 15:19:37,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:19:37,280 INFO L432 NwaCegarLoop]: 819 mSDtfsCounter, 44 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:37,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1614 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:19:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2024-10-11 15:19:37,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1228. [2024-10-11 15:19:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 877 states have (on average 1.4218928164196123) internal successors, (1247), 893 states have internal predecessors, (1247), 270 states have call successors, (270), 80 states have call predecessors, (270), 78 states have return successors, (278), 260 states have call predecessors, (278), 264 states have call successors, (278) [2024-10-11 15:19:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1795 transitions. [2024-10-11 15:19:37,358 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1795 transitions. Word has length 26 [2024-10-11 15:19:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:37,358 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1795 transitions. [2024-10-11 15:19:37,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 15:19:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1795 transitions. [2024-10-11 15:19:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 15:19:37,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:37,364 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:37,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 15:19:37,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:37,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash -104212358, now seen corresponding path program 1 times [2024-10-11 15:19:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:37,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970980552] [2024-10-11 15:19:37,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:37,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:37,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:37,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:19:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:37,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:19:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:19:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 15:19:37,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:37,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970980552] [2024-10-11 15:19:37,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970980552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:37,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:37,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:19:37,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653122486] [2024-10-11 15:19:37,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:37,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:19:37,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:37,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:19:37,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:19:37,572 INFO L87 Difference]: Start difference. First operand 1228 states and 1795 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 15:19:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:39,907 INFO L93 Difference]: Finished difference Result 2460 states and 3593 transitions. [2024-10-11 15:19:39,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:19:39,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2024-10-11 15:19:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:39,915 INFO L225 Difference]: With dead ends: 2460 [2024-10-11 15:19:39,915 INFO L226 Difference]: Without dead ends: 1236 [2024-10-11 15:19:39,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:19:39,922 INFO L432 NwaCegarLoop]: 869 mSDtfsCounter, 1225 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:39,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 1783 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 15:19:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-10-11 15:19:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2024-10-11 15:19:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 875 states have (on average 1.4205714285714286) internal successors, (1243), 889 states have internal predecessors, (1243), 266 states have call successors, (266), 80 states have call predecessors, (266), 78 states have return successors, (262), 258 states have call predecessors, (262), 255 states have call successors, (262) [2024-10-11 15:19:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1771 transitions. [2024-10-11 15:19:39,979 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1771 transitions. Word has length 47 [2024-10-11 15:19:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:39,980 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1771 transitions. [2024-10-11 15:19:39,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 15:19:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1771 transitions. [2024-10-11 15:19:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 15:19:39,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:39,984 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:39,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 15:19:39,985 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:39,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1035017503, now seen corresponding path program 1 times [2024-10-11 15:19:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:39,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773077679] [2024-10-11 15:19:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:40,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:19:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:19:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:19:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 15:19:40,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:40,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773077679] [2024-10-11 15:19:40,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773077679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:40,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:40,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:19:40,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773347308] [2024-10-11 15:19:40,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:40,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:19:40,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:40,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:19:40,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:19:40,184 INFO L87 Difference]: Start difference. First operand 1222 states and 1771 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 15:19:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:42,138 INFO L93 Difference]: Finished difference Result 1329 states and 1900 transitions. [2024-10-11 15:19:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:19:42,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2024-10-11 15:19:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:42,194 INFO L225 Difference]: With dead ends: 1329 [2024-10-11 15:19:42,194 INFO L226 Difference]: Without dead ends: 1009 [2024-10-11 15:19:42,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:19:42,199 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 231 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:42,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 2541 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 15:19:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-10-11 15:19:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1002. [2024-10-11 15:19:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 715 states have (on average 1.4027972027972029) internal successors, (1003), 725 states have internal predecessors, (1003), 214 states have call successors, (214), 72 states have call predecessors, (214), 70 states have return successors, (211), 209 states have call predecessors, (211), 204 states have call successors, (211) [2024-10-11 15:19:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1428 transitions. [2024-10-11 15:19:42,254 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1428 transitions. Word has length 46 [2024-10-11 15:19:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:42,255 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1428 transitions. [2024-10-11 15:19:42,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 15:19:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1428 transitions. [2024-10-11 15:19:42,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 15:19:42,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:42,259 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:42,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 15:19:42,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:42,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash -48977102, now seen corresponding path program 1 times [2024-10-11 15:19:42,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:42,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159305666] [2024-10-11 15:19:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:42,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:42,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:19:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:42,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 15:19:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:42,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:19:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:42,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 15:19:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 15:19:42,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:42,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159305666] [2024-10-11 15:19:42,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159305666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:42,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:42,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 15:19:42,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999441272] [2024-10-11 15:19:42,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:42,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:19:42,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:42,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:19:42,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:19:42,549 INFO L87 Difference]: Start difference. First operand 1002 states and 1428 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 15:19:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:44,681 INFO L93 Difference]: Finished difference Result 1224 states and 1747 transitions. [2024-10-11 15:19:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:19:44,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-10-11 15:19:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:44,689 INFO L225 Difference]: With dead ends: 1224 [2024-10-11 15:19:44,689 INFO L226 Difference]: Without dead ends: 1016 [2024-10-11 15:19:44,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:19:44,691 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 511 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:44,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 2367 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 15:19:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-10-11 15:19:44,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 996. [2024-10-11 15:19:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 710 states have (on average 1.404225352112676) internal successors, (997), 723 states have internal predecessors, (997), 214 states have call successors, (214), 72 states have call predecessors, (214), 69 states have return successors, (207), 205 states have call predecessors, (207), 204 states have call successors, (207) [2024-10-11 15:19:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1418 transitions. [2024-10-11 15:19:44,777 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1418 transitions. Word has length 48 [2024-10-11 15:19:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:44,778 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1418 transitions. [2024-10-11 15:19:44,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 15:19:44,779 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1418 transitions. [2024-10-11 15:19:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 15:19:44,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:44,781 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:44,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 15:19:44,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:44,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:44,783 INFO L85 PathProgramCache]: Analyzing trace with hash -182183637, now seen corresponding path program 1 times [2024-10-11 15:19:44,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:44,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618015329] [2024-10-11 15:19:44,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:44,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:44,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:44,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:19:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:44,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:19:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:44,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 15:19:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:44,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 15:19:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:44,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:19:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 15:19:44,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:44,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618015329] [2024-10-11 15:19:44,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618015329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:44,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:44,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:19:44,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246882321] [2024-10-11 15:19:44,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:44,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:19:44,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:44,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:19:44,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:19:44,961 INFO L87 Difference]: Start difference. First operand 996 states and 1418 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 15:19:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:46,602 INFO L93 Difference]: Finished difference Result 2014 states and 2872 transitions. [2024-10-11 15:19:46,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:19:46,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 52 [2024-10-11 15:19:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:46,613 INFO L225 Difference]: With dead ends: 2014 [2024-10-11 15:19:46,613 INFO L226 Difference]: Without dead ends: 1019 [2024-10-11 15:19:46,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:19:46,618 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 188 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:46,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 2153 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 15:19:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2024-10-11 15:19:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 999. [2024-10-11 15:19:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 712 states have (on average 1.401685393258427) internal successors, (998), 725 states have internal predecessors, (998), 215 states have call successors, (215), 72 states have call predecessors, (215), 69 states have return successors, (208), 206 states have call predecessors, (208), 205 states have call successors, (208) [2024-10-11 15:19:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1421 transitions. [2024-10-11 15:19:46,674 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1421 transitions. Word has length 52 [2024-10-11 15:19:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:46,675 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1421 transitions. [2024-10-11 15:19:46,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 15:19:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1421 transitions. [2024-10-11 15:19:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 15:19:46,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:46,678 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:46,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 15:19:46,679 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:46,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:46,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2103159048, now seen corresponding path program 1 times [2024-10-11 15:19:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:46,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787721334] [2024-10-11 15:19:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:46,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:46,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:46,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:19:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:46,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:19:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:46,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 15:19:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:46,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:19:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:46,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:19:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:46,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 15:19:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:46,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:19:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 15:19:46,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:46,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787721334] [2024-10-11 15:19:46,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787721334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:46,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:46,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:19:46,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419048131] [2024-10-11 15:19:46,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:46,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:19:46,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:46,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:19:46,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:19:46,872 INFO L87 Difference]: Start difference. First operand 999 states and 1421 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 15:19:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:47,948 INFO L93 Difference]: Finished difference Result 2008 states and 2882 transitions. [2024-10-11 15:19:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:19:47,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 60 [2024-10-11 15:19:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:47,957 INFO L225 Difference]: With dead ends: 2008 [2024-10-11 15:19:47,957 INFO L226 Difference]: Without dead ends: 1013 [2024-10-11 15:19:47,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:19:47,963 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 183 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:47,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1612 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 15:19:47,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2024-10-11 15:19:48,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 993. [2024-10-11 15:19:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 707 states have (on average 1.3988684582743989) internal successors, (989), 719 states have internal predecessors, (989), 215 states have call successors, (215), 72 states have call predecessors, (215), 69 states have return successors, (208), 206 states have call predecessors, (208), 205 states have call successors, (208) [2024-10-11 15:19:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1412 transitions. [2024-10-11 15:19:48,022 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1412 transitions. Word has length 60 [2024-10-11 15:19:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:48,022 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1412 transitions. [2024-10-11 15:19:48,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 15:19:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1412 transitions. [2024-10-11 15:19:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 15:19:48,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:48,025 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:48,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 15:19:48,025 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting get_currentErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:48,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash -756739532, now seen corresponding path program 1 times [2024-10-11 15:19:48,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:48,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911154218] [2024-10-11 15:19:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:48,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:48,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:48,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:19:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:48,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:19:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:48,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 15:19:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:19:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:48,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:19:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 15:19:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:48,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:19:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 15:19:48,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911154218] [2024-10-11 15:19:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911154218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:48,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:48,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:19:48,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436821344] [2024-10-11 15:19:48,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:48,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:19:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:48,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:19:48,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:19:48,185 INFO L87 Difference]: Start difference. First operand 993 states and 1412 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 15:19:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:49,206 INFO L93 Difference]: Finished difference Result 2002 states and 2871 transitions. [2024-10-11 15:19:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:19:49,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-11 15:19:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:49,213 INFO L225 Difference]: With dead ends: 2002 [2024-10-11 15:19:49,213 INFO L226 Difference]: Without dead ends: 1013 [2024-10-11 15:19:49,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:19:49,218 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 180 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:49,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1609 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 15:19:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2024-10-11 15:19:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 993. [2024-10-11 15:19:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 707 states have (on average 1.3903818953323903) internal successors, (983), 719 states have internal predecessors, (983), 215 states have call successors, (215), 72 states have call predecessors, (215), 69 states have return successors, (208), 206 states have call predecessors, (208), 205 states have call successors, (208) [2024-10-11 15:19:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1406 transitions. [2024-10-11 15:19:49,338 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1406 transitions. Word has length 68 [2024-10-11 15:19:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:49,338 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1406 transitions. [2024-10-11 15:19:49,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 15:19:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1406 transitions. [2024-10-11 15:19:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 15:19:49,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:49,341 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:49,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 15:19:49,342 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:49,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2038582332, now seen corresponding path program 1 times [2024-10-11 15:19:49,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:49,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876648173] [2024-10-11 15:19:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:49,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:49,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:19:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:49,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:19:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:49,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 15:19:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:49,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:19:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:49,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:19:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:49,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 15:19:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:49,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:19:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:49,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:19:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:49,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:19:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 15:19:49,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:49,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876648173] [2024-10-11 15:19:49,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876648173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:49,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:49,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 15:19:49,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981704706] [2024-10-11 15:19:49,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:49,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:19:49,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:49,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:19:49,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:19:49,577 INFO L87 Difference]: Start difference. First operand 993 states and 1406 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-11 15:19:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:51,496 INFO L93 Difference]: Finished difference Result 1990 states and 2822 transitions. [2024-10-11 15:19:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:19:51,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-10-11 15:19:51,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:51,503 INFO L225 Difference]: With dead ends: 1990 [2024-10-11 15:19:51,504 INFO L226 Difference]: Without dead ends: 1001 [2024-10-11 15:19:51,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:19:51,508 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 373 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:51,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 2826 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 15:19:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-10-11 15:19:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 978. [2024-10-11 15:19:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 693 states have (on average 1.3838383838383839) internal successors, (959), 704 states have internal predecessors, (959), 214 states have call successors, (214), 72 states have call predecessors, (214), 69 states have return successors, (208), 206 states have call predecessors, (208), 205 states have call successors, (208) [2024-10-11 15:19:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1381 transitions. [2024-10-11 15:19:51,581 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1381 transitions. Word has length 71 [2024-10-11 15:19:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:51,582 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1381 transitions. [2024-10-11 15:19:51,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-11 15:19:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1381 transitions. [2024-10-11 15:19:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 15:19:51,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:51,617 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:51,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 15:19:51,617 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting get_currentErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:51,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1249275257, now seen corresponding path program 1 times [2024-10-11 15:19:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:51,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141359724] [2024-10-11 15:19:51,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:51,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:51,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:51,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:19:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:19:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 15:19:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:51,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:19:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:51,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:19:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:51,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 15:19:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:51,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:19:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 15:19:51,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:51,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141359724] [2024-10-11 15:19:51,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141359724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:51,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:51,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:19:51,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597227650] [2024-10-11 15:19:51,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:51,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:19:51,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:51,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:19:51,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:19:51,740 INFO L87 Difference]: Start difference. First operand 978 states and 1381 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 15:19:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:52,700 INFO L93 Difference]: Finished difference Result 1966 states and 2806 transitions. [2024-10-11 15:19:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:19:52,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 71 [2024-10-11 15:19:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:52,706 INFO L225 Difference]: With dead ends: 1966 [2024-10-11 15:19:52,707 INFO L226 Difference]: Without dead ends: 992 [2024-10-11 15:19:52,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:19:52,711 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 175 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:52,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1609 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 15:19:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-10-11 15:19:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 972. [2024-10-11 15:19:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 688 states have (on average 1.380813953488372) internal successors, (950), 698 states have internal predecessors, (950), 214 states have call successors, (214), 72 states have call predecessors, (214), 69 states have return successors, (208), 206 states have call predecessors, (208), 205 states have call successors, (208) [2024-10-11 15:19:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1372 transitions. [2024-10-11 15:19:52,763 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1372 transitions. Word has length 71 [2024-10-11 15:19:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:52,764 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1372 transitions. [2024-10-11 15:19:52,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 15:19:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1372 transitions. [2024-10-11 15:19:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 15:19:52,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:52,769 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:52,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 15:19:52,769 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:52,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2032307051, now seen corresponding path program 1 times [2024-10-11 15:19:52,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:52,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965639304] [2024-10-11 15:19:52,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:52,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:52,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:52,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:19:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:52,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:19:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:52,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 15:19:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:52,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:19:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:52,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:19:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:52,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 15:19:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:52,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 15:19:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:19:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:19:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 15:19:52,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:52,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965639304] [2024-10-11 15:19:52,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965639304] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:19:52,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561548606] [2024-10-11 15:19:52,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:52,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:19:52,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:19:52,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:19:52,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 15:19:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:53,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 15:19:53,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:19:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 15:19:53,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:19:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 15:19:53,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561548606] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:19:53,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:19:53,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2024-10-11 15:19:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530038549] [2024-10-11 15:19:53,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:19:53,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:19:53,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:53,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:19:53,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:19:53,739 INFO L87 Difference]: Start difference. First operand 972 states and 1372 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-11 15:19:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:55,421 INFO L93 Difference]: Finished difference Result 2094 states and 2994 transitions. [2024-10-11 15:19:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:19:55,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 73 [2024-10-11 15:19:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:55,428 INFO L225 Difference]: With dead ends: 2094 [2024-10-11 15:19:55,429 INFO L226 Difference]: Without dead ends: 1126 [2024-10-11 15:19:55,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:19:55,433 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 563 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:55,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1974 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 15:19:55,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2024-10-11 15:19:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1072. [2024-10-11 15:19:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 776 states have (on average 1.4046391752577319) internal successors, (1090), 786 states have internal predecessors, (1090), 226 states have call successors, (226), 72 states have call predecessors, (226), 69 states have return successors, (220), 218 states have call predecessors, (220), 217 states have call successors, (220) [2024-10-11 15:19:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1536 transitions. [2024-10-11 15:19:55,491 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1536 transitions. Word has length 73 [2024-10-11 15:19:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:55,493 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1536 transitions. [2024-10-11 15:19:55,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-11 15:19:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1536 transitions. [2024-10-11 15:19:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 15:19:55,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:55,496 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:55,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 15:19:55,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 15:19:55,698 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:55,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:55,698 INFO L85 PathProgramCache]: Analyzing trace with hash -688484226, now seen corresponding path program 1 times [2024-10-11 15:19:55,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:55,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169482843] [2024-10-11 15:19:55,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:55,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:55,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:55,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:19:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:55,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:19:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:55,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 15:19:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:55,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:19:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:55,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:19:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:55,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 15:19:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:55,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:19:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:55,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:19:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:55,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:19:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:56,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:19:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:56,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:19:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 15:19:56,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:56,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169482843] [2024-10-11 15:19:56,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169482843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:56,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:56,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 15:19:56,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524151067] [2024-10-11 15:19:56,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:56,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 15:19:56,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:56,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 15:19:56,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:19:56,021 INFO L87 Difference]: Start difference. First operand 1072 states and 1536 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 15:19:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:58,338 INFO L93 Difference]: Finished difference Result 1113 states and 1599 transitions. [2024-10-11 15:19:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 15:19:58,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 79 [2024-10-11 15:19:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:58,343 INFO L225 Difference]: With dead ends: 1113 [2024-10-11 15:19:58,343 INFO L226 Difference]: Without dead ends: 1102 [2024-10-11 15:19:58,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 15:19:58,344 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 383 mSDsluCounter, 3181 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 3782 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:58,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 3782 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 15:19:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-10-11 15:19:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1075. [2024-10-11 15:19:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 778 states have (on average 1.4035989717223651) internal successors, (1092), 788 states have internal predecessors, (1092), 227 states have call successors, (227), 72 states have call predecessors, (227), 69 states have return successors, (221), 219 states have call predecessors, (221), 218 states have call successors, (221) [2024-10-11 15:19:58,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1540 transitions. [2024-10-11 15:19:58,401 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1540 transitions. Word has length 79 [2024-10-11 15:19:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:58,401 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1540 transitions. [2024-10-11 15:19:58,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 15:19:58,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1540 transitions. [2024-10-11 15:19:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 15:19:58,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:58,405 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:58,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 15:19:58,405 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:58,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:58,406 INFO L85 PathProgramCache]: Analyzing trace with hash 876901413, now seen corresponding path program 1 times [2024-10-11 15:19:58,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:58,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32919111] [2024-10-11 15:19:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:58,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:19:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:19:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:19:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:19:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 15:19:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:19:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:19:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 15:19:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:19:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:19:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:19:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:19:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:19:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:19:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 15:19:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:19:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32919111] [2024-10-11 15:19:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32919111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:19:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:19:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:19:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921232882] [2024-10-11 15:19:58,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:19:58,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:19:58,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:19:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:19:58,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:19:58,607 INFO L87 Difference]: Start difference. First operand 1075 states and 1540 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 15:19:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:19:59,897 INFO L93 Difference]: Finished difference Result 2188 states and 3140 transitions. [2024-10-11 15:19:59,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:19:59,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 81 [2024-10-11 15:19:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:19:59,903 INFO L225 Difference]: With dead ends: 2188 [2024-10-11 15:19:59,903 INFO L226 Difference]: Without dead ends: 1117 [2024-10-11 15:19:59,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:19:59,906 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 695 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:19:59,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1842 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 15:19:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-10-11 15:19:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1075. [2024-10-11 15:19:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 778 states have (on average 1.3971722365038561) internal successors, (1087), 788 states have internal predecessors, (1087), 227 states have call successors, (227), 72 states have call predecessors, (227), 69 states have return successors, (221), 219 states have call predecessors, (221), 218 states have call successors, (221) [2024-10-11 15:19:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1535 transitions. [2024-10-11 15:19:59,993 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1535 transitions. Word has length 81 [2024-10-11 15:19:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:19:59,994 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1535 transitions. [2024-10-11 15:19:59,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 15:19:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1535 transitions. [2024-10-11 15:19:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 15:19:59,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:19:59,997 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:19:59,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 15:19:59,998 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:19:59,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:19:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash -360885467, now seen corresponding path program 1 times [2024-10-11 15:19:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:19:59,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949828550] [2024-10-11 15:19:59,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:19:59,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:20:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:20:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 15:20:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:20:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 15:20:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:20:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:20:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:20:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:20:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 15:20:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 15:20:00,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:00,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949828550] [2024-10-11 15:20:00,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949828550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:00,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:00,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 15:20:00,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018298835] [2024-10-11 15:20:00,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:00,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 15:20:00,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:00,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 15:20:00,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:20:00,479 INFO L87 Difference]: Start difference. First operand 1075 states and 1535 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 15:20:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:03,191 INFO L93 Difference]: Finished difference Result 2180 states and 3137 transitions. [2024-10-11 15:20:03,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:20:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 89 [2024-10-11 15:20:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:03,198 INFO L225 Difference]: With dead ends: 2180 [2024-10-11 15:20:03,198 INFO L226 Difference]: Without dead ends: 1097 [2024-10-11 15:20:03,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-11 15:20:03,202 INFO L432 NwaCegarLoop]: 602 mSDtfsCounter, 367 mSDsluCounter, 2735 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:03,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 3337 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 15:20:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-10-11 15:20:03,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1075. [2024-10-11 15:20:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 778 states have (on average 1.3946015424164524) internal successors, (1085), 788 states have internal predecessors, (1085), 227 states have call successors, (227), 72 states have call predecessors, (227), 69 states have return successors, (221), 219 states have call predecessors, (221), 218 states have call successors, (221) [2024-10-11 15:20:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1533 transitions. [2024-10-11 15:20:03,259 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1533 transitions. Word has length 89 [2024-10-11 15:20:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:03,259 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1533 transitions. [2024-10-11 15:20:03,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 15:20:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1533 transitions. [2024-10-11 15:20:03,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 15:20:03,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:03,263 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:20:03,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 15:20:03,264 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:20:03,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:03,264 INFO L85 PathProgramCache]: Analyzing trace with hash -415432568, now seen corresponding path program 1 times [2024-10-11 15:20:03,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:03,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236592323] [2024-10-11 15:20:03,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:03,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:20:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:20:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:20:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:20:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 15:20:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 15:20:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 15:20:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:20:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:20:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 15:20:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 15:20:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:20:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 15:20:03,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:03,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236592323] [2024-10-11 15:20:03,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236592323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:03,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:03,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 15:20:03,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395825367] [2024-10-11 15:20:03,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:03,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 15:20:03,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:03,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 15:20:03,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:20:03,728 INFO L87 Difference]: Start difference. First operand 1075 states and 1533 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 15:20:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:06,345 INFO L93 Difference]: Finished difference Result 2172 states and 3107 transitions. [2024-10-11 15:20:06,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 15:20:06,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2024-10-11 15:20:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:06,354 INFO L225 Difference]: With dead ends: 2172 [2024-10-11 15:20:06,354 INFO L226 Difference]: Without dead ends: 1099 [2024-10-11 15:20:06,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 15:20:06,360 INFO L432 NwaCegarLoop]: 602 mSDtfsCounter, 358 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:06,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 3831 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 15:20:06,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2024-10-11 15:20:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1085. [2024-10-11 15:20:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 784 states have (on average 1.3915816326530612) internal successors, (1091), 795 states have internal predecessors, (1091), 227 states have call successors, (227), 72 states have call predecessors, (227), 73 states have return successors, (231), 222 states have call predecessors, (231), 218 states have call successors, (231) [2024-10-11 15:20:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1549 transitions. [2024-10-11 15:20:06,453 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1549 transitions. Word has length 91 [2024-10-11 15:20:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:06,454 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1549 transitions. [2024-10-11 15:20:06,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 15:20:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1549 transitions. [2024-10-11 15:20:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 15:20:06,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:06,458 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:20:06,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 15:20:06,459 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:20:06,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:06,459 INFO L85 PathProgramCache]: Analyzing trace with hash -89304073, now seen corresponding path program 1 times [2024-10-11 15:20:06,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:06,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920739138] [2024-10-11 15:20:06,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:06,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:20:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:20:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:20:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 15:20:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 15:20:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 15:20:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:20:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 15:20:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 15:20:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 15:20:06,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:06,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920739138] [2024-10-11 15:20:06,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920739138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:06,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:06,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 15:20:06,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532437652] [2024-10-11 15:20:06,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:06,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:20:06,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:06,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:20:06,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:20:06,839 INFO L87 Difference]: Start difference. First operand 1085 states and 1549 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 15:20:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:08,919 INFO L93 Difference]: Finished difference Result 2178 states and 3117 transitions. [2024-10-11 15:20:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:20:08,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 93 [2024-10-11 15:20:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:08,927 INFO L225 Difference]: With dead ends: 2178 [2024-10-11 15:20:08,928 INFO L226 Difference]: Without dead ends: 1097 [2024-10-11 15:20:08,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:20:08,932 INFO L432 NwaCegarLoop]: 602 mSDtfsCounter, 380 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:08,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 2806 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 15:20:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-10-11 15:20:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1083. [2024-10-11 15:20:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 783 states have (on average 1.3908045977011494) internal successors, (1089), 794 states have internal predecessors, (1089), 226 states have call successors, (226), 72 states have call predecessors, (226), 73 states have return successors, (230), 221 states have call predecessors, (230), 217 states have call successors, (230) [2024-10-11 15:20:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1545 transitions. [2024-10-11 15:20:08,998 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1545 transitions. Word has length 93 [2024-10-11 15:20:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:08,999 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1545 transitions. [2024-10-11 15:20:09,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 15:20:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1545 transitions. [2024-10-11 15:20:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 15:20:09,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:09,006 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:20:09,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 15:20:09,006 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:20:09,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash 445646508, now seen corresponding path program 1 times [2024-10-11 15:20:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:09,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317098382] [2024-10-11 15:20:09,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:09,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:20:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:20:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:20:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 15:20:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 15:20:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 15:20:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:20:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 15:20:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 15:20:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:20:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 15:20:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317098382] [2024-10-11 15:20:09,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317098382] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:20:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019454561] [2024-10-11 15:20:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:09,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:20:09,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:20:09,322 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:20:09,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 15:20:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:09,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 15:20:09,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:20:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 15:20:09,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:20:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019454561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:09,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:20:09,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 9 [2024-10-11 15:20:09,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77147409] [2024-10-11 15:20:09,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:09,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:20:09,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:09,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:20:09,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:20:09,931 INFO L87 Difference]: Start difference. First operand 1083 states and 1545 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 15:20:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:10,409 INFO L93 Difference]: Finished difference Result 2166 states and 3090 transitions. [2024-10-11 15:20:10,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:20:10,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 106 [2024-10-11 15:20:10,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:10,415 INFO L225 Difference]: With dead ends: 2166 [2024-10-11 15:20:10,415 INFO L226 Difference]: Without dead ends: 1076 [2024-10-11 15:20:10,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:20:10,418 INFO L432 NwaCegarLoop]: 803 mSDtfsCounter, 3 mSDsluCounter, 3998 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4801 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:10,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4801 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 15:20:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-10-11 15:20:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1076. [2024-10-11 15:20:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 778 states have (on average 1.3881748071979434) internal successors, (1080), 790 states have internal predecessors, (1080), 224 states have call successors, (224), 72 states have call predecessors, (224), 73 states have return successors, (227), 218 states have call predecessors, (227), 215 states have call successors, (227) [2024-10-11 15:20:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1531 transitions. [2024-10-11 15:20:10,476 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1531 transitions. Word has length 106 [2024-10-11 15:20:10,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:10,476 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1531 transitions. [2024-10-11 15:20:10,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 15:20:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1531 transitions. [2024-10-11 15:20:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 15:20:10,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:10,482 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:20:10,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 15:20:10,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:20:10,683 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:20:10,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:10,684 INFO L85 PathProgramCache]: Analyzing trace with hash 222298826, now seen corresponding path program 1 times [2024-10-11 15:20:10,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:10,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458851276] [2024-10-11 15:20:10,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:10,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:20:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:20:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:20:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 15:20:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 15:20:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 15:20:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:20:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:20:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 15:20:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 15:20:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 15:20:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 15:20:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 15:20:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 15:20:10,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:10,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458851276] [2024-10-11 15:20:10,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458851276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:10,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:10,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 15:20:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498876349] [2024-10-11 15:20:10,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:10,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:20:10,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:10,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:20:10,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:20:10,974 INFO L87 Difference]: Start difference. First operand 1076 states and 1531 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 15:20:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:13,032 INFO L93 Difference]: Finished difference Result 1153 states and 1629 transitions. [2024-10-11 15:20:13,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:20:13,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-11 15:20:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:13,039 INFO L225 Difference]: With dead ends: 1153 [2024-10-11 15:20:13,039 INFO L226 Difference]: Without dead ends: 952 [2024-10-11 15:20:13,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:20:13,041 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 356 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 2825 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:13,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 2825 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1788 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 15:20:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-10-11 15:20:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 942. [2024-10-11 15:20:13,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 689 states have (on average 1.3962264150943395) internal successors, (962), 699 states have internal predecessors, (962), 190 states have call successors, (190), 62 states have call predecessors, (190), 62 states have return successors, (191), 185 states have call predecessors, (191), 183 states have call successors, (191) [2024-10-11 15:20:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1343 transitions. [2024-10-11 15:20:13,094 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1343 transitions. Word has length 144 [2024-10-11 15:20:13,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:13,095 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1343 transitions. [2024-10-11 15:20:13,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 15:20:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1343 transitions. [2024-10-11 15:20:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 15:20:13,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:13,100 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:20:13,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 15:20:13,101 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN] === [2024-10-11 15:20:13,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:13,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1518617640, now seen corresponding path program 1 times [2024-10-11 15:20:13,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:13,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941720966] [2024-10-11 15:20:13,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:13,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 15:20:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:20:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:20:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 15:20:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 15:20:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 15:20:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:20:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:20:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 15:20:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 15:20:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 15:20:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 15:20:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 15:20:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 15:20:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 15:20:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 15:20:13,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:13,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941720966] [2024-10-11 15:20:13,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941720966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:13,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:13,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 15:20:13,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042830238] [2024-10-11 15:20:13,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:13,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:20:13,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:13,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:20:13,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:20:13,387 INFO L87 Difference]: Start difference. First operand 942 states and 1343 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 15:20:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:15,204 INFO L93 Difference]: Finished difference Result 1039 states and 1468 transitions. [2024-10-11 15:20:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:20:15,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-10-11 15:20:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:15,209 INFO L225 Difference]: With dead ends: 1039 [2024-10-11 15:20:15,209 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 15:20:15,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:20:15,212 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 351 mSDsluCounter, 2168 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 2056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:15,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 2752 Invalid, 2056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 15:20:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 15:20:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 15:20:15,213 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) [2024-10-11 15:20:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 15:20:15,215 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2024-10-11 15:20:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:15,216 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 15:20:15,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 15:20:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 15:20:15,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 15:20:15,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location get_currentErr0ASSERT_VIOLATIONUNKNOWN (2 of 3 remaining) [2024-10-11 15:20:15,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-10-11 15:20:15,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location is_compat_taskErr0ASSERT_VIOLATIONUNKNOWN (0 of 3 remaining) [2024-10-11 15:20:15,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 15:20:15,223 INFO L407 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] [2024-10-11 15:20:15,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.