./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-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.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-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.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 781669661afd0476205c0d0f127c7931dffbaabf4aae46244e576c29ee5a8115 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 15:20:33,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:20:34,033 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:20:34,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:20:34,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:20:34,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:20:34,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:20:34,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:20:34,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:20:34,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:20:34,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:20:34,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:20:34,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:20:34,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:20:34,107 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:20:34,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:20:34,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:20:34,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:20:34,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:20:34,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:20:34,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:20:34,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:20:34,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:20:34,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:20:34,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:20:34,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:20:34,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:20:34,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:20:34,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:20:34,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:20:34,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:20:34,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:20:34,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:20:34,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:20:34,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:20:34,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:20:34,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:20:34,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:20:34,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:20:34,116 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 -> 781669661afd0476205c0d0f127c7931dffbaabf4aae46244e576c29ee5a8115 [2024-10-11 15:20:34,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:20:34,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:20:34,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:20:34,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:20:34,430 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:20:34,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i [2024-10-11 15:20:35,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:20:36,415 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:20:36,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i [2024-10-11 15:20:36,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a58acc008/a4660ef2422c4d34a87e0fa8f55bff32/FLAG353fe78d6 [2024-10-11 15:20:36,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a58acc008/a4660ef2422c4d34a87e0fa8f55bff32 [2024-10-11 15:20:36,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:20:36,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:20:36,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:20:36,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:20:36,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:20:36,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:20:36" (1/1) ... [2024-10-11 15:20:36,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc5e5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:36, skipping insertion in model container [2024-10-11 15:20:36,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:20:36" (1/1) ... [2024-10-11 15:20:36,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:20:37,575 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-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i[163937,163950] [2024-10-11 15:20:38,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:20:38,299 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:20:38,387 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"); [5448] [2024-10-11 15:20:38,390 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; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5455] [2024-10-11 15:20:38,390 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; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5463-5464] [2024-10-11 15:20:38,394 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; incl %0": "+m" (v->counter)); [5493] [2024-10-11 15:20:38,394 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; decl %0": "+m" (v->counter)); [5500] [2024-10-11 15:20:38,407 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-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i[163937,163950] [2024-10-11 15:20:38,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:20:38,706 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:20:38,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:38 WrapperNode [2024-10-11 15:20:38,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:20:38,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:20:38,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:20:38,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:20:38,716 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:20:38" (1/1) ... [2024-10-11 15:20:38,774 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:20:38" (1/1) ... [2024-10-11 15:20:38,891 INFO L138 Inliner]: procedures = 160, calls = 872, calls flagged for inlining = 73, calls inlined = 73, statements flattened = 2752 [2024-10-11 15:20:38,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:20:38,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:20:38,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:20:38,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:20:38,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:38" (1/1) ... [2024-10-11 15:20:38,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:38" (1/1) ... [2024-10-11 15:20:38,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:38" (1/1) ... [2024-10-11 15:20:39,291 INFO L175 MemorySlicer]: Split 527 memory accesses to 8 slices as follows [385, 2, 19, 19, 42, 9, 9, 42]. 73 percent of accesses are in the largest equivalence class. The 210 initializations are split as follows [124, 2, 0, 0, 42, 0, 0, 42]. The 110 writes are split as follows [94, 0, 11, 0, 0, 0, 5, 0]. [2024-10-11 15:20:39,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:38" (1/1) ... [2024-10-11 15:20:39,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:38" (1/1) ... [2024-10-11 15:20:39,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:38" (1/1) ... [2024-10-11 15:20:39,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:38" (1/1) ... [2024-10-11 15:20:39,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:38" (1/1) ... [2024-10-11 15:20:39,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:38" (1/1) ... [2024-10-11 15:20:39,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:20:39,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:20:39,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:20:39,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:20:39,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:38" (1/1) ... [2024-10-11 15:20:39,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:20:39,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:20:39,520 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:20:39,522 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:20:39,579 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2024-10-11 15:20:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2024-10-11 15:20:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2024-10-11 15:20:39,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2024-10-11 15:20:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_17 [2024-10-11 15:20:39,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_17 [2024-10-11 15:20:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2024-10-11 15:20:39,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2024-10-11 15:20:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2024-10-11 15:20:39,582 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2024-10-11 15:20:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-11 15:20:39,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-11 15:20:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 15:20:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 15:20:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 15:20:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 15:20:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 15:20:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 15:20:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 15:20:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 15:20:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-10-11 15:20:39,583 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-10-11 15:20:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure can_free_echo_skb [2024-10-11 15:20:39,583 INFO L138 BoogieDeclarations]: Found implementation of procedure can_free_echo_skb [2024-10-11 15:20:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2024-10-11 15:20:39,584 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2024-10-11 15:20:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2024-10-11 15:20:39,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2024-10-11 15:20:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2024-10-11 15:20:39,584 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2024-10-11 15:20:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-11 15:20:39,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-11 15:20:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:20:39,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:20:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2024-10-11 15:20:39,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2024-10-11 15:20:39,585 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2024-10-11 15:20:39,585 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2024-10-11 15:20:39,585 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 15:20:39,585 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 15:20:39,587 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2024-10-11 15:20:39,587 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2024-10-11 15:20:39,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 15:20:39,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 15:20:39,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 15:20:39,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 15:20:39,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 15:20:39,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 15:20:39,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 15:20:39,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 15:20:39,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:20:39,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:20:39,589 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2024-10-11 15:20:39,589 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2024-10-11 15:20:39,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-11 15:20:39,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-11 15:20:39,589 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 15:20:39,590 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 15:20:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-10-11 15:20:39,590 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-10-11 15:20:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:20:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2024-10-11 15:20:39,592 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2024-10-11 15:20:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2024-10-11 15:20:39,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2024-10-11 15:20:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_4 [2024-10-11 15:20:39,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_4 [2024-10-11 15:20:39,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:20:39,593 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2024-10-11 15:20:39,593 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2024-10-11 15:20:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-11 15:20:39,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-11 15:20:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:20:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:20:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:20:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:20:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 15:20:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 15:20:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 15:20:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 15:20:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 15:20:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-11 15:20:39,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-11 15:20:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2024-10-11 15:20:39,596 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2024-10-11 15:20:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2024-10-11 15:20:39,596 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2024-10-11 15:20:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:20:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:20:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:20:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:20:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:20:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:20:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 15:20:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 15:20:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2024-10-11 15:20:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2024-10-11 15:20:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2024-10-11 15:20:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2024-10-11 15:20:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2024-10-11 15:20:39,599 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2024-10-11 15:20:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:20:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:20:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:20:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:20:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:20:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:20:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:20:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 15:20:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 15:20:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2024-10-11 15:20:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2024-10-11 15:20:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure esd_usb2_read_bulk_callback [2024-10-11 15:20:39,602 INFO L138 BoogieDeclarations]: Found implementation of procedure esd_usb2_read_bulk_callback [2024-10-11 15:20:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-11 15:20:39,602 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-11 15:20:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2024-10-11 15:20:39,603 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2024-10-11 15:20:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure esd_usb2_send_msg [2024-10-11 15:20:39,603 INFO L138 BoogieDeclarations]: Found implementation of procedure esd_usb2_send_msg [2024-10-11 15:20:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2024-10-11 15:20:39,603 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2024-10-11 15:20:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-11 15:20:39,603 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-11 15:20:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-10-11 15:20:39,604 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-10-11 15:20:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2024-10-11 15:20:39,604 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2024-10-11 15:20:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-10-11 15:20:39,604 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-10-11 15:20:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2024-10-11 15:20:39,604 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2024-10-11 15:20:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2024-10-11 15:20:39,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2024-10-11 15:20:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2024-10-11 15:20:39,605 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2024-10-11 15:20:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2024-10-11 15:20:39,605 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2024-10-11 15:20:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:20:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:20:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:20:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 15:20:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 15:20:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 15:20:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 15:20:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 15:20:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2024-10-11 15:20:39,606 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2024-10-11 15:20:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-11 15:20:39,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-11 15:20:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2024-10-11 15:20:39,606 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2024-10-11 15:20:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure esd_usb2_disconnect [2024-10-11 15:20:39,606 INFO L138 BoogieDeclarations]: Found implementation of procedure esd_usb2_disconnect [2024-10-11 15:20:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:20:39,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:20:40,172 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:20:40,176 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:20:40,280 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-11 15:20:40,533 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2024-10-11 15:20:42,396 INFO L? ?]: Removed 1051 outVars from TransFormulas that were not future-live. [2024-10-11 15:20:42,396 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:20:42,626 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:20:42,626 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 15:20:42,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:20:42 BoogieIcfgContainer [2024-10-11 15:20:42,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:20:42,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:20:42,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:20:42,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:20:42,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:20:36" (1/3) ... [2024-10-11 15:20:42,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba49c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:20:42, skipping insertion in model container [2024-10-11 15:20:42,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:38" (2/3) ... [2024-10-11 15:20:42,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba49c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:20:42, skipping insertion in model container [2024-10-11 15:20:42,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:20:42" (3/3) ... [2024-10-11 15:20:42,637 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--esd_usb2.ko-entry_point.cil.out.i [2024-10-11 15:20:42,655 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:20:42,656 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 15:20:42,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:20:42,763 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;@689b1f69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:20:42,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 15:20:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 731 states, 513 states have (on average 1.4366471734892787) internal successors, (737), 539 states have internal predecessors, (737), 167 states have call successors, (167), 51 states have call predecessors, (167), 49 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-10-11 15:20:42,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 15:20:42,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:42,783 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:42,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash -960918780, now seen corresponding path program 1 times [2024-10-11 15:20:42,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:42,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628182433] [2024-10-11 15:20:42,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:42,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:20:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:20:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:20:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:20:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:20:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:20:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 15:20:43,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:43,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628182433] [2024-10-11 15:20:43,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628182433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:43,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:43,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:20:43,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506256304] [2024-10-11 15:20:43,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:43,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:20:43,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:43,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:20:43,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:20:43,558 INFO L87 Difference]: Start difference. First operand has 731 states, 513 states have (on average 1.4366471734892787) internal successors, (737), 539 states have internal predecessors, (737), 167 states have call successors, (167), 51 states have call predecessors, (167), 49 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 15:20:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:45,848 INFO L93 Difference]: Finished difference Result 2300 states and 3447 transitions. [2024-10-11 15:20:45,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:20:45,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-10-11 15:20:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:45,882 INFO L225 Difference]: With dead ends: 2300 [2024-10-11 15:20:45,883 INFO L226 Difference]: Without dead ends: 1547 [2024-10-11 15:20:45,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:20:45,899 INFO L432 NwaCegarLoop]: 855 mSDtfsCounter, 1283 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:45,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 2030 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 15:20:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-11 15:20:46,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1393. [2024-10-11 15:20:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 998 states have (on average 1.3847695390781563) internal successors, (1382), 1024 states have internal predecessors, (1382), 298 states have call successors, (298), 97 states have call predecessors, (298), 96 states have return successors, (293), 289 states have call predecessors, (293), 293 states have call successors, (293) [2024-10-11 15:20:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1973 transitions. [2024-10-11 15:20:46,122 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1973 transitions. Word has length 78 [2024-10-11 15:20:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:46,123 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1973 transitions. [2024-10-11 15:20:46,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 15:20:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1973 transitions. [2024-10-11 15:20:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 15:20:46,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:46,129 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:20:46,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:46,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:46,131 INFO L85 PathProgramCache]: Analyzing trace with hash -201133714, now seen corresponding path program 1 times [2024-10-11 15:20:46,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:46,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954550949] [2024-10-11 15:20:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:46,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:20:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:20:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:20:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:20:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:20:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:20:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:20:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 15:20:46,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:46,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954550949] [2024-10-11 15:20:46,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954550949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:46,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:46,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:20:46,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549401613] [2024-10-11 15:20:46,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:46,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:20:46,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:46,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:20:46,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:20:46,827 INFO L87 Difference]: Start difference. First operand 1393 states and 1973 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 15:20:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:49,152 INFO L93 Difference]: Finished difference Result 4440 states and 6385 transitions. [2024-10-11 15:20:49,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:20:49,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-10-11 15:20:49,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:49,178 INFO L225 Difference]: With dead ends: 4440 [2024-10-11 15:20:49,179 INFO L226 Difference]: Without dead ends: 3070 [2024-10-11 15:20:49,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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:20:49,189 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 1159 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:49,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 2483 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 15:20:49,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3070 states. [2024-10-11 15:20:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3070 to 2752. [2024-10-11 15:20:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2752 states, 1979 states have (on average 1.3850429509853461) internal successors, (2741), 2027 states have internal predecessors, (2741), 580 states have call successors, (580), 193 states have call predecessors, (580), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2024-10-11 15:20:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 3906 transitions. [2024-10-11 15:20:49,351 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 3906 transitions. Word has length 87 [2024-10-11 15:20:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:49,354 INFO L471 AbstractCegarLoop]: Abstraction has 2752 states and 3906 transitions. [2024-10-11 15:20:49,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 15:20:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3906 transitions. [2024-10-11 15:20:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 15:20:49,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:49,361 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:20:49,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:49,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1940511700, now seen corresponding path program 1 times [2024-10-11 15:20:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:49,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65887242] [2024-10-11 15:20:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:49,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:20:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:20:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:20:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:20:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:20:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:20:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:20:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 15:20:49,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:49,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65887242] [2024-10-11 15:20:49,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65887242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:49,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:49,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:20:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002366321] [2024-10-11 15:20:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:49,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:20:49,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:49,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:20:49,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:20:49,960 INFO L87 Difference]: Start difference. First operand 2752 states and 3906 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 15:20:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:51,286 INFO L93 Difference]: Finished difference Result 3062 states and 4426 transitions. [2024-10-11 15:20:51,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:20:51,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-10-11 15:20:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:51,307 INFO L225 Difference]: With dead ends: 3062 [2024-10-11 15:20:51,307 INFO L226 Difference]: Without dead ends: 3059 [2024-10-11 15:20:51,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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:20:51,311 INFO L432 NwaCegarLoop]: 814 mSDtfsCounter, 1102 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:51,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 1253 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 15:20:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2024-10-11 15:20:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2751. [2024-10-11 15:20:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 1979 states have (on average 1.3845376452753917) internal successors, (2740), 2026 states have internal predecessors, (2740), 579 states have call successors, (579), 193 states have call predecessors, (579), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2024-10-11 15:20:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 3904 transitions. [2024-10-11 15:20:51,510 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 3904 transitions. Word has length 88 [2024-10-11 15:20:51,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:51,511 INFO L471 AbstractCegarLoop]: Abstraction has 2751 states and 3904 transitions. [2024-10-11 15:20:51,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 15:20:51,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 3904 transitions. [2024-10-11 15:20:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 15:20:51,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:51,513 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 15:20:51,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:51,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash -26649551, now seen corresponding path program 1 times [2024-10-11 15:20:51,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:51,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354606092] [2024-10-11 15:20:51,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:51,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:20:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:20:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:20:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:20:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:20:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:20:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:20:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 15:20:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354606092] [2024-10-11 15:20:51,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354606092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:51,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:20:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728095355] [2024-10-11 15:20:51,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:51,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:20:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:20:51,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:20:51,748 INFO L87 Difference]: Start difference. First operand 2751 states and 3904 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 15:20:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:52,880 INFO L93 Difference]: Finished difference Result 3061 states and 4424 transitions. [2024-10-11 15:20:52,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:20:52,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-10-11 15:20:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:52,900 INFO L225 Difference]: With dead ends: 3061 [2024-10-11 15:20:52,900 INFO L226 Difference]: Without dead ends: 3058 [2024-10-11 15:20:52,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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:20:52,904 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 1101 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:52,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 1245 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 15:20:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2024-10-11 15:20:53,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2750. [2024-10-11 15:20:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 1979 states have (on average 1.384032339565437) internal successors, (2739), 2025 states have internal predecessors, (2739), 578 states have call successors, (578), 193 states have call predecessors, (578), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2024-10-11 15:20:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3902 transitions. [2024-10-11 15:20:53,164 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3902 transitions. Word has length 89 [2024-10-11 15:20:53,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:53,166 INFO L471 AbstractCegarLoop]: Abstraction has 2750 states and 3902 transitions. [2024-10-11 15:20:53,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 15:20:53,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3902 transitions. [2024-10-11 15:20:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 15:20:53,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:53,168 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 15:20:53,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:53,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash -826460209, now seen corresponding path program 1 times [2024-10-11 15:20:53,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:53,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428153115] [2024-10-11 15:20:53,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:53,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:20:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:20:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:20:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:20:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:20:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:20:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:20:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 15:20:53,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:53,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428153115] [2024-10-11 15:20:53,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428153115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:53,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:53,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:20:53,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714878734] [2024-10-11 15:20:53,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:53,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:20:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:53,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:20:53,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:20:53,445 INFO L87 Difference]: Start difference. First operand 2750 states and 3902 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 15:20:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:54,694 INFO L93 Difference]: Finished difference Result 3060 states and 4422 transitions. [2024-10-11 15:20:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:20:54,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2024-10-11 15:20:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:54,714 INFO L225 Difference]: With dead ends: 3060 [2024-10-11 15:20:54,715 INFO L226 Difference]: Without dead ends: 3057 [2024-10-11 15:20:54,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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:20:54,721 INFO L432 NwaCegarLoop]: 808 mSDtfsCounter, 1093 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:54,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 1245 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 15:20:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2024-10-11 15:20:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2749. [2024-10-11 15:20:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2749 states, 1979 states have (on average 1.3835270338554826) internal successors, (2738), 2024 states have internal predecessors, (2738), 577 states have call successors, (577), 193 states have call predecessors, (577), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2024-10-11 15:20:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 3900 transitions. [2024-10-11 15:20:54,902 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 3900 transitions. Word has length 90 [2024-10-11 15:20:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:54,904 INFO L471 AbstractCegarLoop]: Abstraction has 2749 states and 3900 transitions. [2024-10-11 15:20:54,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 15:20:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 3900 transitions. [2024-10-11 15:20:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 15:20:54,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:54,907 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 15:20:54,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:54,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:54,908 INFO L85 PathProgramCache]: Analyzing trace with hash 149218036, now seen corresponding path program 1 times [2024-10-11 15:20:54,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:54,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452414206] [2024-10-11 15:20:54,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:54,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:20:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:20:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:20:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:20:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:20:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:20:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:20:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 15:20:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452414206] [2024-10-11 15:20:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452414206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:20:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504107170] [2024-10-11 15:20:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:55,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:20:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:20:55,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:20:55,136 INFO L87 Difference]: Start difference. First operand 2749 states and 3900 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 15:20:56,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:56,428 INFO L93 Difference]: Finished difference Result 3059 states and 4420 transitions. [2024-10-11 15:20:56,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:20:56,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2024-10-11 15:20:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:56,447 INFO L225 Difference]: With dead ends: 3059 [2024-10-11 15:20:56,447 INFO L226 Difference]: Without dead ends: 3050 [2024-10-11 15:20:56,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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:20:56,452 INFO L432 NwaCegarLoop]: 818 mSDtfsCounter, 1082 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:56,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 1254 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 15:20:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3050 states. [2024-10-11 15:20:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3050 to 2742. [2024-10-11 15:20:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2742 states, 1973 states have (on average 1.3826659908768373) internal successors, (2728), 2017 states have internal predecessors, (2728), 576 states have call successors, (576), 193 states have call predecessors, (576), 192 states have return successors, (585), 567 states have call predecessors, (585), 575 states have call successors, (585) [2024-10-11 15:20:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2742 states and 3889 transitions. [2024-10-11 15:20:56,659 INFO L78 Accepts]: Start accepts. Automaton has 2742 states and 3889 transitions. Word has length 91 [2024-10-11 15:20:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:56,659 INFO L471 AbstractCegarLoop]: Abstraction has 2742 states and 3889 transitions. [2024-10-11 15:20:56,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 15:20:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 3889 transitions. [2024-10-11 15:20:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 15:20:56,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:56,664 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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] [2024-10-11 15:20:56,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 15:20:56,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:56,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1733484709, now seen corresponding path program 1 times [2024-10-11 15:20:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:56,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245919136] [2024-10-11 15:20:56,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:56,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:20:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:20:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:20:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:20:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:20:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:20:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 15:20:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 15:20:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 15:20:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 15:20:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 15:20:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 15:20:56,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:56,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245919136] [2024-10-11 15:20:56,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245919136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:56,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:56,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:20:56,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590594774] [2024-10-11 15:20:56,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:56,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:20:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:56,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:20:56,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:20:56,948 INFO L87 Difference]: Start difference. First operand 2742 states and 3889 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 15:20:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:58,873 INFO L93 Difference]: Finished difference Result 6938 states and 9931 transitions. [2024-10-11 15:20:58,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:20:58,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2024-10-11 15:20:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:58,906 INFO L225 Difference]: With dead ends: 6938 [2024-10-11 15:20:58,907 INFO L226 Difference]: Without dead ends: 4219 [2024-10-11 15:20:58,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:20:58,917 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 1133 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 824 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 824 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:58,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1782 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [824 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 15:20:58,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4219 states. [2024-10-11 15:20:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4219 to 3634. [2024-10-11 15:20:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3634 states, 2597 states have (on average 1.3765883711975355) internal successors, (3575), 2653 states have internal predecessors, (3575), 759 states have call successors, (759), 272 states have call predecessors, (759), 277 states have return successors, (786), 752 states have call predecessors, (786), 758 states have call successors, (786) [2024-10-11 15:20:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 5120 transitions. [2024-10-11 15:20:59,232 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 5120 transitions. Word has length 134 [2024-10-11 15:20:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:59,232 INFO L471 AbstractCegarLoop]: Abstraction has 3634 states and 5120 transitions. [2024-10-11 15:20:59,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 15:20:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 5120 transitions. [2024-10-11 15:20:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 15:20:59,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:59,241 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 15:20:59,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:59,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash 554521416, now seen corresponding path program 1 times [2024-10-11 15:20:59,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:59,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193853282] [2024-10-11 15:20:59,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:59,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:20:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:20:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:20:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:20:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:20:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:20:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:20:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:20:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:20:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 15:20:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 15:20:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 15:20:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 15:20:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 15:20:59,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:59,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193853282] [2024-10-11 15:20:59,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193853282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:59,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:59,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:20:59,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505353669] [2024-10-11 15:20:59,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:59,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:20:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:59,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:20:59,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:20:59,646 INFO L87 Difference]: Start difference. First operand 3634 states and 5120 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 15:21:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:01,594 INFO L93 Difference]: Finished difference Result 8788 states and 12507 transitions. [2024-10-11 15:21:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:21:01,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 147 [2024-10-11 15:21:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:01,627 INFO L225 Difference]: With dead ends: 8788 [2024-10-11 15:21:01,631 INFO L226 Difference]: Without dead ends: 5183 [2024-10-11 15:21:01,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:21:01,645 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 986 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:01,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 2120 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 15:21:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2024-10-11 15:21:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 4546. [2024-10-11 15:21:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4546 states, 3251 states have (on average 1.3740387573054444) internal successors, (4467), 3315 states have internal predecessors, (4467), 939 states have call successors, (939), 350 states have call predecessors, (939), 355 states have return successors, (966), 932 states have call predecessors, (966), 938 states have call successors, (966) [2024-10-11 15:21:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4546 states to 4546 states and 6372 transitions. [2024-10-11 15:21:01,970 INFO L78 Accepts]: Start accepts. Automaton has 4546 states and 6372 transitions. Word has length 147 [2024-10-11 15:21:01,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:01,971 INFO L471 AbstractCegarLoop]: Abstraction has 4546 states and 6372 transitions. [2024-10-11 15:21:01,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 15:21:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4546 states and 6372 transitions. [2024-10-11 15:21:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 15:21:01,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:01,979 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 4, 4, 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] [2024-10-11 15:21:01,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 15:21:01,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:01,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2021090664, now seen corresponding path program 1 times [2024-10-11 15:21:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:01,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490047299] [2024-10-11 15:21:01,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:01,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:21:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:21:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:21:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:21:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:21:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:21:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:21:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 15:21:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 15:21:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 15:21:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 15:21:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-10-11 15:21:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:02,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490047299] [2024-10-11 15:21:02,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490047299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:02,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:21:02,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:21:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406141834] [2024-10-11 15:21:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:02,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:21:02,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:02,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:21:02,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:21:02,316 INFO L87 Difference]: Start difference. First operand 4546 states and 6372 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 15:21:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:05,189 INFO L93 Difference]: Finished difference Result 12132 states and 17161 transitions. [2024-10-11 15:21:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 15:21:05,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2024-10-11 15:21:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:05,229 INFO L225 Difference]: With dead ends: 12132 [2024-10-11 15:21:05,229 INFO L226 Difference]: Without dead ends: 7615 [2024-10-11 15:21:05,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-11 15:21:05,244 INFO L432 NwaCegarLoop]: 1047 mSDtfsCounter, 1233 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 2869 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:05,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 2869 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 15:21:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7615 states. [2024-10-11 15:21:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7615 to 6456. [2024-10-11 15:21:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6456 states, 4659 states have (on average 1.3760463618802319) internal successors, (6411), 4751 states have internal predecessors, (6411), 1257 states have call successors, (1257), 528 states have call predecessors, (1257), 539 states have return successors, (1298), 1248 states have call predecessors, (1298), 1256 states have call successors, (1298) [2024-10-11 15:21:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6456 states to 6456 states and 8966 transitions. [2024-10-11 15:21:05,852 INFO L78 Accepts]: Start accepts. Automaton has 6456 states and 8966 transitions. Word has length 160 [2024-10-11 15:21:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:05,853 INFO L471 AbstractCegarLoop]: Abstraction has 6456 states and 8966 transitions. [2024-10-11 15:21:05,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 15:21:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6456 states and 8966 transitions. [2024-10-11 15:21:05,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 15:21:05,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:05,863 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:05,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 15:21:05,863 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:05,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:05,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2114899432, now seen corresponding path program 1 times [2024-10-11 15:21:05,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:05,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759447324] [2024-10-11 15:21:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:05,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:21:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:21:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:21:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:21:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:21:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:21:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:21:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 15:21:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 15:21:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 15:21:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 15:21:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 15:21:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-10-11 15:21:06,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:06,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759447324] [2024-10-11 15:21:06,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759447324] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:21:06,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966816613] [2024-10-11 15:21:06,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:06,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:06,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:21:06,300 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:21:06,301 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:21:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:06,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 1744 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 15:21:06,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:21:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2024-10-11 15:21:07,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:21:07,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966816613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:07,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:21:07,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-11 15:21:07,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740514297] [2024-10-11 15:21:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:07,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:21:07,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:07,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:21:07,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 15:21:07,143 INFO L87 Difference]: Start difference. First operand 6456 states and 8966 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 4 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 15:21:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:08,572 INFO L93 Difference]: Finished difference Result 19315 states and 26820 transitions. [2024-10-11 15:21:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:21:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 4 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 177 [2024-10-11 15:21:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:08,649 INFO L225 Difference]: With dead ends: 19315 [2024-10-11 15:21:08,649 INFO L226 Difference]: Without dead ends: 19310 [2024-10-11 15:21:08,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 15:21:08,661 INFO L432 NwaCegarLoop]: 1174 mSDtfsCounter, 1879 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1879 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:08,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1879 Valid, 2847 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 15:21:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19310 states. [2024-10-11 15:21:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19310 to 19280. [2024-10-11 15:21:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19280 states, 13919 states have (on average 1.3771822688411524) internal successors, (19169), 14211 states have internal predecessors, (19169), 3745 states have call successors, (3745), 1580 states have call predecessors, (3745), 1615 states have return successors, (3870), 3704 states have call predecessors, (3870), 3744 states have call successors, (3870) [2024-10-11 15:21:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19280 states to 19280 states and 26784 transitions. [2024-10-11 15:21:10,094 INFO L78 Accepts]: Start accepts. Automaton has 19280 states and 26784 transitions. Word has length 177 [2024-10-11 15:21:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:10,095 INFO L471 AbstractCegarLoop]: Abstraction has 19280 states and 26784 transitions. [2024-10-11 15:21:10,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 4 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 15:21:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 19280 states and 26784 transitions. [2024-10-11 15:21:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-11 15:21:10,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:10,113 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:10,137 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:21:10,317 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,SelfDestructingSolverStorable9 [2024-10-11 15:21:10,319 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:10,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:10,320 INFO L85 PathProgramCache]: Analyzing trace with hash 752922378, now seen corresponding path program 1 times [2024-10-11 15:21:10,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:10,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807517739] [2024-10-11 15:21:10,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:10,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:21:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:21:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:21:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:21:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:21:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:21:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:21:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 15:21:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 15:21:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 15:21:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 15:21:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 15:21:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 15:21:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2024-10-11 15:21:10,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:10,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807517739] [2024-10-11 15:21:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807517739] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:21:10,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98908240] [2024-10-11 15:21:10,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:10,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:10,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:21:10,663 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:21:10,664 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:21:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:11,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 1780 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:21:11,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:21:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-10-11 15:21:11,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:21:11,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98908240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:11,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:21:11,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 15:21:11,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779781345] [2024-10-11 15:21:11,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:11,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:21:11,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:11,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:21:11,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:21:11,394 INFO L87 Difference]: Start difference. First operand 19280 states and 26784 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 15:21:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:12,254 INFO L93 Difference]: Finished difference Result 29454 states and 40927 transitions. [2024-10-11 15:21:12,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:21:12,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 186 [2024-10-11 15:21:12,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:12,318 INFO L225 Difference]: With dead ends: 29454 [2024-10-11 15:21:12,318 INFO L226 Difference]: Without dead ends: 9571 [2024-10-11 15:21:12,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:21:12,381 INFO L432 NwaCegarLoop]: 1150 mSDtfsCounter, 888 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:12,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 1448 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:21:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9571 states. [2024-10-11 15:21:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9571 to 9571. [2024-10-11 15:21:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9571 states, 6909 states have (on average 1.372991749891446) internal successors, (9486), 7055 states have internal predecessors, (9486), 1861 states have call successors, (1861), 783 states have call predecessors, (1861), 800 states have return successors, (1923), 1840 states have call predecessors, (1923), 1860 states have call successors, (1923) [2024-10-11 15:21:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9571 states to 9571 states and 13270 transitions. [2024-10-11 15:21:13,174 INFO L78 Accepts]: Start accepts. Automaton has 9571 states and 13270 transitions. Word has length 186 [2024-10-11 15:21:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:13,175 INFO L471 AbstractCegarLoop]: Abstraction has 9571 states and 13270 transitions. [2024-10-11 15:21:13,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 15:21:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 9571 states and 13270 transitions. [2024-10-11 15:21:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 15:21:13,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:13,188 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 6, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:13,211 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:21:13,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:13,393 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:13,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1179403634, now seen corresponding path program 1 times [2024-10-11 15:21:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:13,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462427070] [2024-10-11 15:21:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:13,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:21:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:21:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:21:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:21:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:21:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:21:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:21:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 15:21:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 15:21:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 15:21:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 15:21:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 15:21:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 52 proven. 12 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-10-11 15:21:13,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:13,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462427070] [2024-10-11 15:21:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462427070] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:21:13,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964112675] [2024-10-11 15:21:13,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:13,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:13,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:21:13,785 INFO L229 MonitoredProcess]: Starting monitored process 4 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:21:13,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 15:21:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:14,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:21:14,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:21:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-10-11 15:21:14,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:21:14,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964112675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:14,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:21:14,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 15:21:14,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856444570] [2024-10-11 15:21:14,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:14,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:21:14,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:14,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:21:14,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:21:14,446 INFO L87 Difference]: Start difference. First operand 9571 states and 13270 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 15:21:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:15,167 INFO L93 Difference]: Finished difference Result 17793 states and 24700 transitions. [2024-10-11 15:21:15,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:21:15,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 190 [2024-10-11 15:21:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:15,217 INFO L225 Difference]: With dead ends: 17793 [2024-10-11 15:21:15,217 INFO L226 Difference]: Without dead ends: 8944 [2024-10-11 15:21:15,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:21:15,247 INFO L432 NwaCegarLoop]: 1212 mSDtfsCounter, 816 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:15,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1925 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:21:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8944 states. [2024-10-11 15:21:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8944 to 8939. [2024-10-11 15:21:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8939 states, 6466 states have (on average 1.3708629755644912) internal successors, (8864), 6605 states have internal predecessors, (8864), 1729 states have call successors, (1729), 726 states have call predecessors, (1729), 743 states have return successors, (1791), 1709 states have call predecessors, (1791), 1728 states have call successors, (1791) [2024-10-11 15:21:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8939 states to 8939 states and 12384 transitions. [2024-10-11 15:21:16,117 INFO L78 Accepts]: Start accepts. Automaton has 8939 states and 12384 transitions. Word has length 190 [2024-10-11 15:21:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:16,118 INFO L471 AbstractCegarLoop]: Abstraction has 8939 states and 12384 transitions. [2024-10-11 15:21:16,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 15:21:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 8939 states and 12384 transitions. [2024-10-11 15:21:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 15:21:16,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:16,143 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 6, 6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:16,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 15:21:16,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:16,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:16,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:16,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1818452552, now seen corresponding path program 1 times [2024-10-11 15:21:16,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:16,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867785233] [2024-10-11 15:21:16,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:16,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:21:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:21:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:21:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:21:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:21:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:21:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:21:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 15:21:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 15:21:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 15:21:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 15:21:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 15:21:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 15:21:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:21:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 15:21:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:21:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 15:21:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2024-10-11 15:21:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867785233] [2024-10-11 15:21:16,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867785233] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:21:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241052379] [2024-10-11 15:21:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:16,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:16,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:21:16,876 INFO L229 MonitoredProcess]: Starting monitored process 5 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:21:16,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 15:21:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:17,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 1872 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:21:17,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:21:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-11 15:21:17,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:21:17,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241052379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:17,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:21:17,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-11 15:21:17,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297909034] [2024-10-11 15:21:17,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:17,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:21:17,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:17,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:21:17,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 15:21:17,670 INFO L87 Difference]: Start difference. First operand 8939 states and 12384 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-11 15:21:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:18,645 INFO L93 Difference]: Finished difference Result 21915 states and 30333 transitions. [2024-10-11 15:21:18,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:21:18,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 206 [2024-10-11 15:21:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:18,707 INFO L225 Difference]: With dead ends: 21915 [2024-10-11 15:21:18,708 INFO L226 Difference]: Without dead ends: 13009 [2024-10-11 15:21:18,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 15:21:18,736 INFO L432 NwaCegarLoop]: 1384 mSDtfsCounter, 920 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:18,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 2114 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:21:18,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13009 states. [2024-10-11 15:21:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13009 to 12616. [2024-10-11 15:21:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12616 states, 9278 states have (on average 1.3816555292088812) internal successors, (12819), 9475 states have internal predecessors, (12819), 2264 states have call successors, (2264), 1044 states have call predecessors, (2264), 1073 states have return successors, (2360), 2241 states have call predecessors, (2360), 2263 states have call successors, (2360) [2024-10-11 15:21:19,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12616 states to 12616 states and 17443 transitions. [2024-10-11 15:21:19,765 INFO L78 Accepts]: Start accepts. Automaton has 12616 states and 17443 transitions. Word has length 206 [2024-10-11 15:21:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:19,765 INFO L471 AbstractCegarLoop]: Abstraction has 12616 states and 17443 transitions. [2024-10-11 15:21:19,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-11 15:21:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 12616 states and 17443 transitions. [2024-10-11 15:21:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-11 15:21:19,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:19,783 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:21:19,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 15:21:19,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 15:21:19,988 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:19,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1971346241, now seen corresponding path program 1 times [2024-10-11 15:21:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:19,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612643877] [2024-10-11 15:21:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:19,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:21:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:21:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:21:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:21:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:21:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:21:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:21:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 15:21:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 15:21:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 15:21:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 15:21:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 15:21:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 15:21:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 15:21:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 15:21:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-11 15:21:20,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:20,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612643877] [2024-10-11 15:21:20,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612643877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:20,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:21:20,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 15:21:20,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177349858] [2024-10-11 15:21:20,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:20,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:21:20,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:20,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:21:20,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:21:20,429 INFO L87 Difference]: Start difference. First operand 12616 states and 17443 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 15:21:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:22,609 INFO L93 Difference]: Finished difference Result 27600 states and 38708 transitions. [2024-10-11 15:21:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:21:22,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 214 [2024-10-11 15:21:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:22,687 INFO L225 Difference]: With dead ends: 27600 [2024-10-11 15:21:22,687 INFO L226 Difference]: Without dead ends: 15302 [2024-10-11 15:21:22,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:21:22,725 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 960 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:22,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1770 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 15:21:22,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15302 states. [2024-10-11 15:21:23,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15302 to 12626. [2024-10-11 15:21:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12626 states, 9288 states have (on average 1.381244616709733) internal successors, (12829), 9485 states have internal predecessors, (12829), 2264 states have call successors, (2264), 1044 states have call predecessors, (2264), 1073 states have return successors, (2360), 2241 states have call predecessors, (2360), 2263 states have call successors, (2360) [2024-10-11 15:21:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12626 states to 12626 states and 17453 transitions. [2024-10-11 15:21:23,687 INFO L78 Accepts]: Start accepts. Automaton has 12626 states and 17453 transitions. Word has length 214 [2024-10-11 15:21:23,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:23,688 INFO L471 AbstractCegarLoop]: Abstraction has 12626 states and 17453 transitions. [2024-10-11 15:21:23,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 15:21:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 12626 states and 17453 transitions. [2024-10-11 15:21:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 15:21:23,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:23,701 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:21:23,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 15:21:23,701 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:23,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1679753980, now seen corresponding path program 1 times [2024-10-11 15:21:23,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:23,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761010670] [2024-10-11 15:21:23,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:23,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:23,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:23,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:21:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:23,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:21:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:21:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:21:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:21:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:21:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:21:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 15:21:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 15:21:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 15:21:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 15:21:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 15:21:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 15:21:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 15:21:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 15:21:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-11 15:21:24,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:24,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761010670] [2024-10-11 15:21:24,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761010670] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:21:24,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430378632] [2024-10-11 15:21:24,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:24,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:24,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:21:24,159 INFO L229 MonitoredProcess]: Starting monitored process 6 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:21:24,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 15:21:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 1962 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:21:24,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:21:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-11 15:21:24,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:21:24,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430378632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:24,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:21:24,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 15:21:24,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215808898] [2024-10-11 15:21:24,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:24,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:21:24,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:24,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:21:24,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:21:24,827 INFO L87 Difference]: Start difference. First operand 12626 states and 17453 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-11 15:21:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:25,644 INFO L93 Difference]: Finished difference Result 24964 states and 34532 transitions. [2024-10-11 15:21:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:21:25,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 215 [2024-10-11 15:21:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:25,720 INFO L225 Difference]: With dead ends: 24964 [2024-10-11 15:21:25,720 INFO L226 Difference]: Without dead ends: 12656 [2024-10-11 15:21:25,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:21:25,756 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 25 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:25,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1762 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:21:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12656 states. [2024-10-11 15:21:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12656 to 12656. [2024-10-11 15:21:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12656 states, 9318 states have (on average 1.3810903627387852) internal successors, (12869), 9515 states have internal predecessors, (12869), 2264 states have call successors, (2264), 1044 states have call predecessors, (2264), 1073 states have return successors, (2360), 2241 states have call predecessors, (2360), 2263 states have call successors, (2360) [2024-10-11 15:21:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12656 states to 12656 states and 17493 transitions. [2024-10-11 15:21:26,933 INFO L78 Accepts]: Start accepts. Automaton has 12656 states and 17493 transitions. Word has length 215 [2024-10-11 15:21:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:26,934 INFO L471 AbstractCegarLoop]: Abstraction has 12656 states and 17493 transitions. [2024-10-11 15:21:26,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-11 15:21:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 12656 states and 17493 transitions. [2024-10-11 15:21:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 15:21:26,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:26,950 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:21:26,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 15:21:27,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 15:21:27,151 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:27,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash 19576882, now seen corresponding path program 1 times [2024-10-11 15:21:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:27,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581604410] [2024-10-11 15:21:27,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:21:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:21:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:21:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:21:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:21:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:21:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:21:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 15:21:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 15:21:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 15:21:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 15:21:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 15:21:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 15:21:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 15:21:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 15:21:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-11 15:21:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-11 15:21:27,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:27,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581604410] [2024-10-11 15:21:27,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581604410] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:21:27,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014439444] [2024-10-11 15:21:27,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:27,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:27,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:21:27,669 INFO L229 MonitoredProcess]: Starting monitored process 7 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:21:27,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 15:21:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:28,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 1978 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 15:21:28,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:21:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-11 15:21:28,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:21:28,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014439444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:28,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:21:28,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 15:21:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378187018] [2024-10-11 15:21:28,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:28,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:21:28,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:28,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:21:28,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:21:28,348 INFO L87 Difference]: Start difference. First operand 12656 states and 17493 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 15:21:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:29,555 INFO L93 Difference]: Finished difference Result 25034 states and 34622 transitions. [2024-10-11 15:21:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:21:29,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 217 [2024-10-11 15:21:29,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:29,627 INFO L225 Difference]: With dead ends: 25034 [2024-10-11 15:21:29,627 INFO L226 Difference]: Without dead ends: 12696 [2024-10-11 15:21:29,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:21:29,669 INFO L432 NwaCegarLoop]: 903 mSDtfsCounter, 3 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:29,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1794 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:21:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12696 states. [2024-10-11 15:21:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12696 to 12676. [2024-10-11 15:21:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12676 states, 9338 states have (on average 1.3813450417648319) internal successors, (12899), 9535 states have internal predecessors, (12899), 2264 states have call successors, (2264), 1044 states have call predecessors, (2264), 1073 states have return successors, (2360), 2241 states have call predecessors, (2360), 2263 states have call successors, (2360) [2024-10-11 15:21:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12676 states to 12676 states and 17523 transitions. [2024-10-11 15:21:30,524 INFO L78 Accepts]: Start accepts. Automaton has 12676 states and 17523 transitions. Word has length 217 [2024-10-11 15:21:30,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:30,524 INFO L471 AbstractCegarLoop]: Abstraction has 12676 states and 17523 transitions. [2024-10-11 15:21:30,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 15:21:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 12676 states and 17523 transitions. [2024-10-11 15:21:30,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 15:21:30,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:30,537 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:21:30,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 15:21:30,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 15:21:30,738 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:30,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash 267723376, now seen corresponding path program 1 times [2024-10-11 15:21:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:30,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064125891] [2024-10-11 15:21:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:30,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:30,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:30,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:21:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:30,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:21:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:30,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:30,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:30,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:30,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:30,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:21:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:30,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:21:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:30,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:21:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:30,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:21:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:21:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 15:21:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 15:21:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 15:21:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 15:21:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 15:21:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 15:21:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 15:21:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 15:21:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-11 15:21:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-11 15:21:31,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:31,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064125891] [2024-10-11 15:21:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064125891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:21:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126854223] [2024-10-11 15:21:31,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:31,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:31,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:21:31,110 INFO L229 MonitoredProcess]: Starting monitored process 8 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:21:31,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 15:21:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:31,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 1991 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 15:21:31,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:21:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-10-11 15:21:31,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:21:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-11 15:21:31,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126854223] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:21:31,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:21:31,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-11 15:21:31,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888948725] [2024-10-11 15:21:31,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:21:31,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 15:21:31,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:31,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 15:21:31,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 15:21:31,869 INFO L87 Difference]: Start difference. First operand 12676 states and 17523 transitions. Second operand has 11 states, 11 states have (on average 12.909090909090908) internal successors, (142), 7 states have internal predecessors, (142), 2 states have call successors, (58), 6 states have call predecessors, (58), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 15:21:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:34,334 INFO L93 Difference]: Finished difference Result 27740 states and 38908 transitions. [2024-10-11 15:21:34,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 15:21:34,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.909090909090908) internal successors, (142), 7 states have internal predecessors, (142), 2 states have call successors, (58), 6 states have call predecessors, (58), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 217 [2024-10-11 15:21:34,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:34,431 INFO L225 Difference]: With dead ends: 27740 [2024-10-11 15:21:34,431 INFO L226 Difference]: Without dead ends: 15382 [2024-10-11 15:21:34,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 15:21:34,471 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 520 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 1802 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2732 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 1802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:34,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 2732 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 1802 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 15:21:34,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15382 states. [2024-10-11 15:21:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15382 to 12706. [2024-10-11 15:21:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12706 states, 9368 states have (on average 1.380123825789923) internal successors, (12929), 9565 states have internal predecessors, (12929), 2264 states have call successors, (2264), 1044 states have call predecessors, (2264), 1073 states have return successors, (2360), 2241 states have call predecessors, (2360), 2263 states have call successors, (2360) [2024-10-11 15:21:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12706 states to 12706 states and 17553 transitions. [2024-10-11 15:21:35,536 INFO L78 Accepts]: Start accepts. Automaton has 12706 states and 17553 transitions. Word has length 217 [2024-10-11 15:21:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:35,538 INFO L471 AbstractCegarLoop]: Abstraction has 12706 states and 17553 transitions. [2024-10-11 15:21:35,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.909090909090908) internal successors, (142), 7 states have internal predecessors, (142), 2 states have call successors, (58), 6 states have call predecessors, (58), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 15:21:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 12706 states and 17553 transitions. [2024-10-11 15:21:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 15:21:35,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:35,557 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 7, 7, 7, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:35,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 15:21:35,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:35,758 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:35,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:35,758 INFO L85 PathProgramCache]: Analyzing trace with hash -535235101, now seen corresponding path program 1 times [2024-10-11 15:21:35,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:35,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792559362] [2024-10-11 15:21:35,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:35,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:35,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:35,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:35,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:21:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:35,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:21:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:21:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:21:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:21:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:21:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:21:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 15:21:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 15:21:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 15:21:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 15:21:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 15:21:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 15:21:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 15:21:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-10-11 15:21:36,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:36,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792559362] [2024-10-11 15:21:36,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792559362] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:21:36,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309084357] [2024-10-11 15:21:36,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:36,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:36,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:21:36,131 INFO L229 MonitoredProcess]: Starting monitored process 9 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:21:36,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 15:21:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:36,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 15:21:36,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:21:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2024-10-11 15:21:36,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:21:36,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309084357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:36,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:21:36,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-11 15:21:36,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220516473] [2024-10-11 15:21:36,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:36,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:21:36,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:36,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:21:36,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 15:21:36,739 INFO L87 Difference]: Start difference. First operand 12706 states and 17553 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 15:21:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:37,539 INFO L93 Difference]: Finished difference Result 25114 states and 34702 transitions. [2024-10-11 15:21:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:21:37,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 215 [2024-10-11 15:21:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:37,615 INFO L225 Difference]: With dead ends: 25114 [2024-10-11 15:21:37,615 INFO L226 Difference]: Without dead ends: 12726 [2024-10-11 15:21:37,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 15:21:37,650 INFO L432 NwaCegarLoop]: 904 mSDtfsCounter, 0 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:37,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2707 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:21:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12726 states. [2024-10-11 15:21:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12726 to 12726. [2024-10-11 15:21:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12726 states, 9388 states have (on average 1.3793140178951853) internal successors, (12949), 9585 states have internal predecessors, (12949), 2264 states have call successors, (2264), 1044 states have call predecessors, (2264), 1073 states have return successors, (2360), 2241 states have call predecessors, (2360), 2263 states have call successors, (2360) [2024-10-11 15:21:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12726 states to 12726 states and 17573 transitions. [2024-10-11 15:21:38,462 INFO L78 Accepts]: Start accepts. Automaton has 12726 states and 17573 transitions. Word has length 215 [2024-10-11 15:21:38,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:38,462 INFO L471 AbstractCegarLoop]: Abstraction has 12726 states and 17573 transitions. [2024-10-11 15:21:38,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 15:21:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 12726 states and 17573 transitions. [2024-10-11 15:21:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 15:21:38,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:38,471 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:21:38,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 15:21:38,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 15:21:38,672 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:38,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash -744583635, now seen corresponding path program 2 times [2024-10-11 15:21:38,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:38,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477512450] [2024-10-11 15:21:38,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:38,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:21:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:21:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:21:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:21:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:21:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:21:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:21:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 15:21:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 15:21:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 15:21:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 15:21:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 15:21:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 15:21:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 15:21:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 15:21:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 15:21:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-11 15:21:39,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:39,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477512450] [2024-10-11 15:21:39,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477512450] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:21:39,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301399752] [2024-10-11 15:21:39,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 15:21:39,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:39,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:21:39,208 INFO L229 MonitoredProcess]: Starting monitored process 10 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:21:39,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 15:21:39,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 15:21:39,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 15:21:39,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 2036 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 15:21:39,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:21:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 42 proven. 10 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-10-11 15:21:39,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:21:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-11 15:21:40,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301399752] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:21:40,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:21:40,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2024-10-11 15:21:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190250736] [2024-10-11 15:21:40,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:21:40,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 15:21:40,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:40,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 15:21:40,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-10-11 15:21:40,090 INFO L87 Difference]: Start difference. First operand 12726 states and 17573 transitions. Second operand has 17 states, 17 states have (on average 8.705882352941176) internal successors, (148), 13 states have internal predecessors, (148), 2 states have call successors, (58), 6 states have call predecessors, (58), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38)