./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 04:27:15,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:27:15,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-09 04:27:15,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:27:15,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:27:15,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:27:15,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:27:15,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:27:15,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 04:27:15,498 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 04:27:15,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:27:15,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:27:15,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:27:15,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:27:15,500 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 04:27:15,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:27:15,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:27:15,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:27:15,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:27:15,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:27:15,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:27:15,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:27:15,505 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:27:15,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:27:15,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:27:15,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:27:15,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:27:15,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:27:15,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:27:15,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 04:27:15,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:27:15,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:27:15,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:27:15,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 04:27:15,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:27:15,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:27:15,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 04:27:15,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 04:27:15,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:27:15,507 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/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 [2024-11-09 04:27:15,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:27:15,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:27:15,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:27:15,707 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:27:15,708 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:27:15,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-11-09 04:27:16,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:27:17,236 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:27:17,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-11-09 04:27:17,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491c1e789/5c80729153e343a4bc53add7021f3ebc/FLAGe69471026 [2024-11-09 04:27:17,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491c1e789/5c80729153e343a4bc53add7021f3ebc [2024-11-09 04:27:17,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:27:17,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:27:17,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:27:17,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:27:17,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:27:17,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:27:17" (1/1) ... [2024-11-09 04:27:17,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f320b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:17, skipping insertion in model container [2024-11-09 04:27:17,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:27:17" (1/1) ... [2024-11-09 04:27:17,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:27:18,038 WARN L250 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-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2024-11-09 04:27:18,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:27:18,084 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:27:18,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3095-3096] [2024-11-09 04:27:18,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (63), "i" (12UL)); [3374-3375] [2024-11-09 04:27:18,169 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (65), "i" (12UL)); [3382-3383] [2024-11-09 04:27:18,169 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (66), "i" (12UL)); [3390-3391] [2024-11-09 04:27:18,203 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (123), "i" (12UL)); [3605-3606] [2024-11-09 04:27:18,212 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (177), "i" (12UL)); [3680-3681] [2024-11-09 04:27:18,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (467), "i" (12UL)); [4002-4003] [2024-11-09 04:27:18,311 WARN L250 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-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2024-11-09 04:27:18,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:27:18,391 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:27:18,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18 WrapperNode [2024-11-09 04:27:18,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:27:18,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:27:18,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:27:18,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:27:18,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (1/1) ... [2024-11-09 04:27:18,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (1/1) ... [2024-11-09 04:27:18,497 INFO L138 Inliner]: procedures = 143, calls = 525, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1748 [2024-11-09 04:27:18,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:27:18,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:27:18,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:27:18,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:27:18,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (1/1) ... [2024-11-09 04:27:18,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (1/1) ... [2024-11-09 04:27:18,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (1/1) ... [2024-11-09 04:27:18,749 INFO L175 MemorySlicer]: Split 263 memory accesses to 10 slices as follows [2, 4, 1, 8, 25, 8, 1, 21, 192, 1]. 73 percent of accesses are in the largest equivalence class. The 31 initializations are split as follows [2, 0, 0, 8, 0, 8, 0, 0, 13, 0]. The 91 writes are split as follows [0, 2, 1, 0, 3, 0, 0, 21, 63, 1]. [2024-11-09 04:27:18,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (1/1) ... [2024-11-09 04:27:18,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (1/1) ... [2024-11-09 04:27:18,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (1/1) ... [2024-11-09 04:27:18,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (1/1) ... [2024-11-09 04:27:18,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (1/1) ... [2024-11-09 04:27:18,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (1/1) ... [2024-11-09 04:27:18,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:27:18,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:27:18,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:27:18,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:27:18,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (1/1) ... [2024-11-09 04:27:18,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 04:27:18,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:27:18,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 04:27:18,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 04:27:18,908 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2024-11-09 04:27:18,908 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2024-11-09 04:27:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-09 04:27:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-09 04:27:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-09 04:27:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-09 04:27:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-09 04:27:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-09 04:27:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-09 04:27:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-11-09 04:27:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-11-09 04:27:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-11-09 04:27:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2024-11-09 04:27:18,910 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2024-11-09 04:27:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-09 04:27:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-09 04:27:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-09 04:27:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-09 04:27:18,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-09 04:27:18,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-09 04:27:18,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-11-09 04:27:18,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-11-09 04:27:18,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-11-09 04:27:18,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-11-09 04:27:18,912 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-11-09 04:27:18,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-11-09 04:27:18,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 04:27:18,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 04:27:18,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 04:27:18,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 04:27:18,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 04:27:18,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 04:27:18,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 04:27:18,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 04:27:18,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 04:27:18,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 04:27:18,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-09 04:27:18,913 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-09 04:27:18,913 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2024-11-09 04:27:18,913 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2024-11-09 04:27:18,913 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2024-11-09 04:27:18,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2024-11-09 04:27:18,914 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 04:27:18,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 04:27:18,914 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2024-11-09 04:27:18,914 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2024-11-09 04:27:18,914 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2024-11-09 04:27:18,914 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2024-11-09 04:27:18,914 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-11-09 04:27:18,914 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-11-09 04:27:18,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 04:27:18,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 04:27:18,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 04:27:18,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 04:27:18,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 04:27:18,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 04:27:18,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 04:27:18,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 04:27:18,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 04:27:18,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 04:27:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-09 04:27:18,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-09 04:27:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-11-09 04:27:18,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-11-09 04:27:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2024-11-09 04:27:18,916 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2024-11-09 04:27:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2024-11-09 04:27:18,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2024-11-09 04:27:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 04:27:18,917 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 04:27:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:27:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2024-11-09 04:27:18,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2024-11-09 04:27:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2024-11-09 04:27:18,917 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2024-11-09 04:27:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:27:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2024-11-09 04:27:18,917 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2024-11-09 04:27:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:27:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 04:27:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 04:27:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 04:27:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 04:27:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 04:27:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 04:27:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-09 04:27:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-09 04:27:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-09 04:27:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-09 04:27:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-11-09 04:27:18,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-11-09 04:27:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2024-11-09 04:27:18,919 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2024-11-09 04:27:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2024-11-09 04:27:18,919 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2024-11-09 04:27:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 04:27:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 04:27:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 04:27:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 04:27:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 04:27:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 04:27:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-09 04:27:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-09 04:27:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-09 04:27:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-09 04:27:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2024-11-09 04:27:18,920 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2024-11-09 04:27:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-11-09 04:27:18,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-11-09 04:27:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:27:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2024-11-09 04:27:18,921 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2024-11-09 04:27:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2024-11-09 04:27:18,921 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2024-11-09 04:27:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 04:27:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 04:27:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 04:27:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 04:27:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 04:27:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 04:27:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 04:27:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 04:27:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 04:27:18,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 04:27:18,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:27:18,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:27:18,922 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-11-09 04:27:18,922 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-11-09 04:27:19,234 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:27:19,237 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:27:19,288 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-11-09 04:27:24,287 INFO L? ?]: Removed 979 outVars from TransFormulas that were not future-live. [2024-11-09 04:27:24,287 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:27:24,305 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:27:24,305 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 04:27:24,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:27:24 BoogieIcfgContainer [2024-11-09 04:27:24,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:27:24,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:27:24,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:27:24,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:27:24,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:27:17" (1/3) ... [2024-11-09 04:27:24,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420256f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:27:24, skipping insertion in model container [2024-11-09 04:27:24,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:27:18" (2/3) ... [2024-11-09 04:27:24,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420256f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:27:24, skipping insertion in model container [2024-11-09 04:27:24,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:27:24" (3/3) ... [2024-11-09 04:27:24,313 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-11-09 04:27:24,326 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:27:24,326 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:27:24,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:27:24,386 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;@37f3ae4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:27:24,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:27:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 468 states, 357 states have (on average 1.3053221288515406) internal successors, (466), 372 states have internal predecessors, (466), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-09 04:27:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 04:27:24,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:27:24,401 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 04:27:24,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:27:24,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:27:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1910474653, now seen corresponding path program 1 times [2024-11-09 04:27:24,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:27:24,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289895623] [2024-11-09 04:27:24,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:27:24,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:27:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:27:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:24,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:27:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:24,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:27:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 04:27:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:24,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 04:27:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:27:24,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:27:24,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289895623] [2024-11-09 04:27:24,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289895623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:27:24,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:27:24,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:27:24,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132678945] [2024-11-09 04:27:24,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:27:24,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:27:24,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:27:24,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:27:24,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:27:24,965 INFO L87 Difference]: Start difference. First operand has 468 states, 357 states have (on average 1.3053221288515406) internal successors, (466), 372 states have internal predecessors, (466), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 04:27:28,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:27:32,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:27:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:27:34,166 INFO L93 Difference]: Finished difference Result 1030 states and 1437 transitions. [2024-11-09 04:27:34,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:27:34,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2024-11-09 04:27:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:27:34,181 INFO L225 Difference]: With dead ends: 1030 [2024-11-09 04:27:34,181 INFO L226 Difference]: Without dead ends: 547 [2024-11-09 04:27:34,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:27:34,194 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 628 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 357 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:27:34,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 819 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 638 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2024-11-09 04:27:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-09 04:27:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 450. [2024-11-09 04:27:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 346 states have (on average 1.2745664739884393) internal successors, (441), 354 states have internal predecessors, (441), 79 states have call successors, (79), 25 states have call predecessors, (79), 24 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-09 04:27:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 597 transitions. [2024-11-09 04:27:34,276 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 597 transitions. Word has length 46 [2024-11-09 04:27:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:27:34,276 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 597 transitions. [2024-11-09 04:27:34,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 04:27:34,277 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 597 transitions. [2024-11-09 04:27:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 04:27:34,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:27:34,281 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 04:27:34,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:27:34,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:27:34,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:27:34,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1066469151, now seen corresponding path program 1 times [2024-11-09 04:27:34,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:27:34,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735876293] [2024-11-09 04:27:34,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:27:34,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:27:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:34,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:27:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:34,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:27:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:34,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:27:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:34,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 04:27:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:34,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 04:27:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:27:34,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:27:34,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735876293] [2024-11-09 04:27:34,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735876293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:27:34,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:27:34,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:27:34,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904597442] [2024-11-09 04:27:34,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:27:34,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:27:34,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:27:34,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:27:34,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:27:34,563 INFO L87 Difference]: Start difference. First operand 450 states and 597 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 04:27:38,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:27:42,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:27:46,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:27:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:27:48,346 INFO L93 Difference]: Finished difference Result 1485 states and 2026 transitions. [2024-11-09 04:27:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:27:48,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2024-11-09 04:27:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:27:48,353 INFO L225 Difference]: With dead ends: 1485 [2024-11-09 04:27:48,354 INFO L226 Difference]: Without dead ends: 1049 [2024-11-09 04:27:48,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:27:48,357 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1639 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 806 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:27:48,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 1045 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 962 Invalid, 3 Unknown, 0 Unchecked, 13.6s Time] [2024-11-09 04:27:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2024-11-09 04:27:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 856. [2024-11-09 04:27:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 661 states have (on average 1.2783661119515886) internal successors, (845), 676 states have internal predecessors, (845), 149 states have call successors, (149), 46 states have call predecessors, (149), 45 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2024-11-09 04:27:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1141 transitions. [2024-11-09 04:27:48,421 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1141 transitions. Word has length 46 [2024-11-09 04:27:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:27:48,421 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1141 transitions. [2024-11-09 04:27:48,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 04:27:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1141 transitions. [2024-11-09 04:27:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 04:27:48,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:27:48,427 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 04:27:48,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:27:48,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:27:48,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:27:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash 334290039, now seen corresponding path program 1 times [2024-11-09 04:27:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:27:48,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313654341] [2024-11-09 04:27:48,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:27:48,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:27:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:48,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:27:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:48,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:27:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:48,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:27:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:48,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 04:27:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:48,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 04:27:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:27:48,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:27:48,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313654341] [2024-11-09 04:27:48,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313654341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:27:48,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:27:48,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:27:48,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192781953] [2024-11-09 04:27:48,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:27:48,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:27:48,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:27:48,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:27:48,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:27:48,632 INFO L87 Difference]: Start difference. First operand 856 states and 1141 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 04:27:52,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:27:56,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:27:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:27:58,280 INFO L93 Difference]: Finished difference Result 2058 states and 2835 transitions. [2024-11-09 04:27:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:27:58,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2024-11-09 04:27:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:27:58,292 INFO L225 Difference]: With dead ends: 2058 [2024-11-09 04:27:58,292 INFO L226 Difference]: Without dead ends: 2049 [2024-11-09 04:27:58,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:27:58,297 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 1471 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 613 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:27:58,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 1276 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 1105 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2024-11-09 04:27:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2024-11-09 04:27:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1673. [2024-11-09 04:27:58,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1294 states have (on average 1.278207109737249) internal successors, (1654), 1323 states have internal predecessors, (1654), 289 states have call successors, (289), 90 states have call predecessors, (289), 89 states have return successors, (287), 287 states have call predecessors, (287), 287 states have call successors, (287) [2024-11-09 04:27:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2230 transitions. [2024-11-09 04:27:58,390 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2230 transitions. Word has length 49 [2024-11-09 04:27:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:27:58,391 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2230 transitions. [2024-11-09 04:27:58,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 04:27:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2230 transitions. [2024-11-09 04:27:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 04:27:58,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:27:58,400 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2024-11-09 04:27:58,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:27:58,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:27:58,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:27:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1595417057, now seen corresponding path program 1 times [2024-11-09 04:27:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:27:58,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50658374] [2024-11-09 04:27:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:27:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:27:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:27:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:27:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:27:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 04:27:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 04:27:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 04:27:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 04:27:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:27:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 04:27:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 04:27:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 04:27:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:27:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:27:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 04:27:58,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:27:58,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50658374] [2024-11-09 04:27:58,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50658374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:27:58,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:27:58,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 04:27:58,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825395557] [2024-11-09 04:27:58,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:27:58,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:27:58,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:27:58,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:27:58,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:27:58,746 INFO L87 Difference]: Start difference. First operand 1673 states and 2230 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 04:28:02,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:28:06,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:28:10,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:28:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:28:12,919 INFO L93 Difference]: Finished difference Result 6150 states and 8502 transitions. [2024-11-09 04:28:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 04:28:12,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-09 04:28:12,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:28:12,959 INFO L225 Difference]: With dead ends: 6150 [2024-11-09 04:28:12,959 INFO L226 Difference]: Without dead ends: 4491 [2024-11-09 04:28:12,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-09 04:28:12,970 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 2003 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 972 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2067 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 972 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:28:12,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2067 Valid, 1311 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [972 Valid, 1192 Invalid, 3 Unknown, 0 Unchecked, 13.8s Time] [2024-11-09 04:28:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2024-11-09 04:28:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 3103. [2024-11-09 04:28:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3103 states, 2392 states have (on average 1.2767558528428093) internal successors, (3054), 2449 states have internal predecessors, (3054), 535 states have call successors, (535), 176 states have call predecessors, (535), 175 states have return successors, (533), 533 states have call predecessors, (533), 533 states have call successors, (533) [2024-11-09 04:28:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 4122 transitions. [2024-11-09 04:28:13,132 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 4122 transitions. Word has length 110 [2024-11-09 04:28:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:28:13,133 INFO L471 AbstractCegarLoop]: Abstraction has 3103 states and 4122 transitions. [2024-11-09 04:28:13,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 04:28:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 4122 transitions. [2024-11-09 04:28:13,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 04:28:13,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:28:13,141 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 04:28:13,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:28:13,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:28:13,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:28:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1669692005, now seen corresponding path program 1 times [2024-11-09 04:28:13,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:28:13,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594437276] [2024-11-09 04:28:13,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:28:13,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:28:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:28:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:28:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 04:28:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 04:28:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 04:28:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:28:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 04:28:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:28:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 04:28:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 04:28:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 04:28:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 04:28:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 04:28:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-09 04:28:13,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:28:13,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594437276] [2024-11-09 04:28:13,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594437276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:28:13,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:28:13,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 04:28:13,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617667970] [2024-11-09 04:28:13,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:28:13,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:28:13,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:28:13,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:28:13,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:28:13,564 INFO L87 Difference]: Start difference. First operand 3103 states and 4122 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 04:28:17,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:28:21,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:28:25,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:28:29,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:28:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:28:31,200 INFO L93 Difference]: Finished difference Result 7579 states and 10395 transitions. [2024-11-09 04:28:31,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:28:31,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 153 [2024-11-09 04:28:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:28:31,227 INFO L225 Difference]: With dead ends: 7579 [2024-11-09 04:28:31,227 INFO L226 Difference]: Without dead ends: 4494 [2024-11-09 04:28:31,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:28:31,239 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 862 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 539 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:28:31,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1569 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 1411 Invalid, 4 Unknown, 0 Unchecked, 17.4s Time] [2024-11-09 04:28:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2024-11-09 04:28:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 3106. [2024-11-09 04:28:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 2395 states have (on average 1.2755741127348643) internal successors, (3055), 2452 states have internal predecessors, (3055), 535 states have call successors, (535), 176 states have call predecessors, (535), 175 states have return successors, (533), 533 states have call predecessors, (533), 533 states have call successors, (533) [2024-11-09 04:28:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4123 transitions. [2024-11-09 04:28:31,371 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4123 transitions. Word has length 153 [2024-11-09 04:28:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:28:31,371 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 4123 transitions. [2024-11-09 04:28:31,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 04:28:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4123 transitions. [2024-11-09 04:28:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 04:28:31,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:28:31,376 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 04:28:31,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:28:31,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:28:31,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:28:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash 319297636, now seen corresponding path program 1 times [2024-11-09 04:28:31,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:28:31,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877058287] [2024-11-09 04:28:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:28:31,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:28:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:31,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:28:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:31,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:31,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:28:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:31,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 04:28:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:31,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 04:28:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:31,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 04:28:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:31,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:28:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:31,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 04:28:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:31,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:31,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:28:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 04:28:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:32,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 04:28:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:32,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 04:28:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:32,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 04:28:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:32,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 04:28:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:32,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 04:28:32,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:28:32,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877058287] [2024-11-09 04:28:32,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877058287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:28:32,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:28:32,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:28:32,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851696690] [2024-11-09 04:28:32,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:28:32,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:28:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:28:32,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:28:32,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:28:32,071 INFO L87 Difference]: Start difference. First operand 3106 states and 4123 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 04:28:36,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:28:40,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:28:44,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:28:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:28:45,675 INFO L93 Difference]: Finished difference Result 7572 states and 10379 transitions. [2024-11-09 04:28:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:28:45,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 154 [2024-11-09 04:28:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:28:45,703 INFO L225 Difference]: With dead ends: 7572 [2024-11-09 04:28:45,704 INFO L226 Difference]: Without dead ends: 4486 [2024-11-09 04:28:45,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 04:28:45,719 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 744 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 409 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:28:45,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1852 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 1828 Invalid, 3 Unknown, 0 Unchecked, 13.4s Time] [2024-11-09 04:28:45,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2024-11-09 04:28:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 3110. [2024-11-09 04:28:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3110 states, 2397 states have (on average 1.2753441802252816) internal successors, (3057), 2456 states have internal predecessors, (3057), 535 states have call successors, (535), 176 states have call predecessors, (535), 177 states have return successors, (549), 533 states have call predecessors, (549), 533 states have call successors, (549) [2024-11-09 04:28:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 4141 transitions. [2024-11-09 04:28:45,885 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 4141 transitions. Word has length 154 [2024-11-09 04:28:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:28:45,885 INFO L471 AbstractCegarLoop]: Abstraction has 3110 states and 4141 transitions. [2024-11-09 04:28:45,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 04:28:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 4141 transitions. [2024-11-09 04:28:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-09 04:28:45,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:28:45,891 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:28:45,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 04:28:45,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:28:45,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:28:45,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2081756232, now seen corresponding path program 1 times [2024-11-09 04:28:45,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:28:45,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365394503] [2024-11-09 04:28:45,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:28:45,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:28:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:28:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:28:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 04:28:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 04:28:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 04:28:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:28:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 04:28:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:28:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 04:28:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 04:28:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 04:28:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:28:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 04:28:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 04:28:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-09 04:28:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-09 04:28:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-09 04:28:46,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:28:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365394503] [2024-11-09 04:28:46,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365394503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:28:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120904642] [2024-11-09 04:28:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:28:46,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:28:46,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:28:46,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:28:46,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:28:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:47,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 04:28:47,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:28:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 04:28:47,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:28:47,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120904642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:28:47,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:28:47,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-09 04:28:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589143817] [2024-11-09 04:28:47,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:28:47,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:28:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:28:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:28:47,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:28:47,272 INFO L87 Difference]: Start difference. First operand 3110 states and 4141 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 04:28:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:28:47,384 INFO L93 Difference]: Finished difference Result 6208 states and 8270 transitions. [2024-11-09 04:28:47,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:28:47,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 175 [2024-11-09 04:28:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:28:47,402 INFO L225 Difference]: With dead ends: 6208 [2024-11-09 04:28:47,402 INFO L226 Difference]: Without dead ends: 3111 [2024-11-09 04:28:47,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:28:47,414 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:28:47,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1779 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:28:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2024-11-09 04:28:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3111. [2024-11-09 04:28:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3111 states, 2398 states have (on average 1.275229357798165) internal successors, (3058), 2457 states have internal predecessors, (3058), 535 states have call successors, (535), 176 states have call predecessors, (535), 177 states have return successors, (549), 533 states have call predecessors, (549), 533 states have call successors, (549) [2024-11-09 04:28:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 4142 transitions. [2024-11-09 04:28:47,562 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 4142 transitions. Word has length 175 [2024-11-09 04:28:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:28:47,563 INFO L471 AbstractCegarLoop]: Abstraction has 3111 states and 4142 transitions. [2024-11-09 04:28:47,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 04:28:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 4142 transitions. [2024-11-09 04:28:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 04:28:47,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:28:47,569 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:28:47,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:28:47,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:28:47,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:28:47,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:28:47,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1027532278, now seen corresponding path program 1 times [2024-11-09 04:28:47,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:28:47,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598039633] [2024-11-09 04:28:47,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:28:47,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:28:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:28:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:28:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 04:28:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 04:28:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 04:28:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:28:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 04:28:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:28:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 04:28:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 04:28:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 04:28:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:28:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 04:28:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 04:28:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 04:28:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-09 04:28:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:28:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 04:28:48,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:28:48,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598039633] [2024-11-09 04:28:48,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598039633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:28:48,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775899415] [2024-11-09 04:28:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:28:48,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:28:48,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:28:48,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:28:48,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:28:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:28:49,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 04:28:49,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:28:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-09 04:28:49,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:28:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 04:28:49,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775899415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:28:49,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:28:49,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 16 [2024-11-09 04:28:49,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509221330] [2024-11-09 04:28:49,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:28:49,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 04:28:49,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:28:49,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 04:28:49,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-09 04:28:49,392 INFO L87 Difference]: Start difference. First operand 3111 states and 4142 transitions. Second operand has 16 states, 16 states have (on average 8.0625) internal successors, (129), 12 states have internal predecessors, (129), 2 states have call successors, (38), 6 states have call predecessors, (38), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32)