./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 13:07:47,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 13:07:47,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 13:07:47,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 13:07:47,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 13:07:47,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 13:07:47,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 13:07:47,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 13:07:47,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 13:07:47,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 13:07:47,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 13:07:47,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 13:07:47,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 13:07:47,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 13:07:47,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 13:07:47,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 13:07:47,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 13:07:47,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 13:07:47,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 13:07:47,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 13:07:47,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 13:07:47,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 13:07:47,794 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 13:07:47,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 13:07:47,795 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 13:07:47,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 13:07:47,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 13:07:47,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 13:07:47,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 13:07:47,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 13:07:47,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 13:07:47,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 13:07:47,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 13:07:47,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 13:07:47,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 13:07:47,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 13:07:47,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 13:07:47,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 13:07:47,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 13:07:47,798 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84 [2024-11-07 13:07:48,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 13:07:48,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 13:07:48,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 13:07:48,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 13:07:48,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 13:07:48,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2024-11-07 13:07:49,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 13:07:49,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 13:07:49,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2024-11-07 13:07:49,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b79150ca/b676017f3e60467dbeeacf7374a99436/FLAG5f7e26421 [2024-11-07 13:07:49,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b79150ca/b676017f3e60467dbeeacf7374a99436 [2024-11-07 13:07:49,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 13:07:49,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 13:07:49,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 13:07:49,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 13:07:49,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 13:07:49,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:49" (1/1) ... [2024-11-07 13:07:49,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72046372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:49, skipping insertion in model container [2024-11-07 13:07:49,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:49" (1/1) ... [2024-11-07 13:07:50,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 13:07:50,337 WARN L1351 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2024-11-07 13:07:50,338 WARN L1351 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2024-11-07 13:07:50,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2024-11-07 13:07:50,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 13:07:50,609 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 13:07:50,653 WARN L1351 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2024-11-07 13:07:50,654 WARN L1351 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2024-11-07 13:07:50,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [1855] [2024-11-07 13:07:50,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1858] [2024-11-07 13:07:50,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1861] [2024-11-07 13:07:50,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1864] [2024-11-07 13:07:50,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [1902] [2024-11-07 13:07:50,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2024-11-07 13:07:50,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 13:07:50,771 INFO L204 MainTranslator]: Completed translation [2024-11-07 13:07:50,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50 WrapperNode [2024-11-07 13:07:50,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 13:07:50,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 13:07:50,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 13:07:50,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 13:07:50,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (1/1) ... [2024-11-07 13:07:50,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (1/1) ... [2024-11-07 13:07:50,854 INFO L138 Inliner]: procedures = 114, calls = 293, calls flagged for inlining = 50, calls inlined = 38, statements flattened = 960 [2024-11-07 13:07:50,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 13:07:50,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 13:07:50,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 13:07:50,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 13:07:50,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (1/1) ... [2024-11-07 13:07:50,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (1/1) ... [2024-11-07 13:07:50,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (1/1) ... [2024-11-07 13:07:50,921 INFO L175 MemorySlicer]: Split 79 memory accesses to 14 slices as follows [2, 12, 0, 4, 1, 1, 24, 4, 1, 12, 2, 5, 1, 10]. 30 percent of accesses are in the largest equivalence class. The 55 initializations are split as follows [2, 1, 0, 4, 1, 1, 18, 4, 1, 12, 1, 0, 0, 10]. The 9 writes are split as follows [0, 4, 0, 0, 0, 0, 1, 0, 0, 0, 0, 3, 1, 0]. [2024-11-07 13:07:50,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (1/1) ... [2024-11-07 13:07:50,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (1/1) ... [2024-11-07 13:07:50,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (1/1) ... [2024-11-07 13:07:50,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (1/1) ... [2024-11-07 13:07:50,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (1/1) ... [2024-11-07 13:07:50,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (1/1) ... [2024-11-07 13:07:51,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 13:07:51,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 13:07:51,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 13:07:51,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 13:07:51,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (1/1) ... [2024-11-07 13:07:51,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 13:07:51,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 13:07:51,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 13:07:51,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 13:07:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2024-11-07 13:07:51,053 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2024-11-07 13:07:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2024-11-07 13:07:51,053 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2024-11-07 13:07:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-11-07 13:07:51,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-11-07 13:07:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 13:07:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 13:07:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 13:07:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 13:07:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 13:07:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 13:07:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-07 13:07:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-07 13:07:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-07 13:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-07 13:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-07 13:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-07 13:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-07 13:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-07 13:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2024-11-07 13:07:51,054 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2024-11-07 13:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2024-11-07 13:07:51,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2024-11-07 13:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-07 13:07:51,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-07 13:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2024-11-07 13:07:51,054 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2024-11-07 13:07:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2024-11-07 13:07:51,054 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2024-11-07 13:07:51,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-11-07 13:07:51,055 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2024-11-07 13:07:51,055 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-07 13:07:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-07 13:07:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2024-11-07 13:07:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2024-11-07 13:07:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2024-11-07 13:07:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 13:07:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2024-11-07 13:07:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2024-11-07 13:07:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-07 13:07:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2024-11-07 13:07:51,057 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-07 13:07:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-07 13:07:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-07 13:07:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2024-11-07 13:07:51,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2024-11-07 13:07:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2024-11-07 13:07:51,061 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2024-11-07 13:07:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 13:07:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 13:07:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-07 13:07:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2024-11-07 13:07:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-11-07 13:07:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-11-07 13:07:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2024-11-07 13:07:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2024-11-07 13:07:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-11-07 13:07:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-11-07 13:07:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2024-11-07 13:07:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2024-11-07 13:07:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 13:07:51,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 13:07:51,328 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 13:07:51,330 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 13:07:51,353 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-11-07 13:07:52,308 INFO L? ?]: Removed 301 outVars from TransFormulas that were not future-live. [2024-11-07 13:07:52,308 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 13:07:52,329 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 13:07:52,330 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 13:07:52,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:52 BoogieIcfgContainer [2024-11-07 13:07:52,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 13:07:52,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 13:07:52,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 13:07:52,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 13:07:52,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:07:49" (1/3) ... [2024-11-07 13:07:52,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c72436f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:52, skipping insertion in model container [2024-11-07 13:07:52,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:50" (2/3) ... [2024-11-07 13:07:52,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c72436f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:52, skipping insertion in model container [2024-11-07 13:07:52,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:52" (3/3) ... [2024-11-07 13:07:52,338 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2024-11-07 13:07:52,351 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 13:07:52,352 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 13:07:52,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 13:07:52,430 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;@6d62084a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 13:07:52,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 13:07:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 380 states, 281 states have (on average 1.387900355871886) internal successors, (390), 294 states have internal predecessors, (390), 70 states have call successors, (70), 28 states have call predecessors, (70), 27 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-07 13:07:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 13:07:52,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:07:52,449 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:07:52,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:07:52,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:07:52,455 INFO L85 PathProgramCache]: Analyzing trace with hash 799306126, now seen corresponding path program 1 times [2024-11-07 13:07:52,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:07:52,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915413299] [2024-11-07 13:07:52,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:07:52,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:07:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:07:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:07:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:53,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:07:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:53,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 13:07:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 13:07:53,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:07:53,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915413299] [2024-11-07 13:07:53,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915413299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:07:53,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:07:53,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 13:07:53,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503261412] [2024-11-07 13:07:53,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:07:53,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 13:07:53,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:07:53,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 13:07:53,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 13:07:53,110 INFO L87 Difference]: Start difference. First operand has 380 states, 281 states have (on average 1.387900355871886) internal successors, (390), 294 states have internal predecessors, (390), 70 states have call successors, (70), 28 states have call predecessors, (70), 27 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 13:07:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:07:54,363 INFO L93 Difference]: Finished difference Result 1117 states and 1567 transitions. [2024-11-07 13:07:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 13:07:54,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2024-11-07 13:07:54,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:07:54,382 INFO L225 Difference]: With dead ends: 1117 [2024-11-07 13:07:54,383 INFO L226 Difference]: Without dead ends: 622 [2024-11-07 13:07:54,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 13:07:54,393 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 730 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 13:07:54,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 736 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 13:07:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-07 13:07:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 565. [2024-11-07 13:07:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 428 states have (on average 1.3644859813084111) internal successors, (584), 436 states have internal predecessors, (584), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-07 13:07:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 769 transitions. [2024-11-07 13:07:54,500 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 769 transitions. Word has length 48 [2024-11-07 13:07:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:07:54,502 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 769 transitions. [2024-11-07 13:07:54,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 13:07:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 769 transitions. [2024-11-07 13:07:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 13:07:54,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:07:54,511 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:07:54,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 13:07:54,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:07:54,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:07:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1808027181, now seen corresponding path program 1 times [2024-11-07 13:07:54,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:07:54,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594730245] [2024-11-07 13:07:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:07:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:07:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:54,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:07:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:54,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:07:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:54,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:07:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:54,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 13:07:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:07:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 13:07:54,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:07:54,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594730245] [2024-11-07 13:07:54,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594730245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:07:54,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:07:54,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 13:07:54,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272600817] [2024-11-07 13:07:54,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:07:54,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 13:07:54,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:07:54,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 13:07:54,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 13:07:54,816 INFO L87 Difference]: Start difference. First operand 565 states and 769 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 13:07:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:07:55,482 INFO L93 Difference]: Finished difference Result 1164 states and 1593 transitions. [2024-11-07 13:07:55,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 13:07:55,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2024-11-07 13:07:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:07:55,489 INFO L225 Difference]: With dead ends: 1164 [2024-11-07 13:07:55,489 INFO L226 Difference]: Without dead ends: 619 [2024-11-07 13:07:55,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 13:07:55,492 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 593 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 13:07:55,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 531 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 13:07:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-07 13:07:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 565. [2024-11-07 13:07:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 428 states have (on average 1.3621495327102804) internal successors, (583), 436 states have internal predecessors, (583), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-07 13:07:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 768 transitions. [2024-11-07 13:07:55,560 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 768 transitions. Word has length 54 [2024-11-07 13:07:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:07:55,560 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 768 transitions. [2024-11-07 13:07:55,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 13:07:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 768 transitions. [2024-11-07 13:07:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 13:07:55,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:07:55,565 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:07:55,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 13:07:55,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:07:55,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:07:55,566 INFO L85 PathProgramCache]: Analyzing trace with hash 856967870, now seen corresponding path program 1 times [2024-11-07 13:07:55,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:07:55,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547217040] [2024-11-07 13:07:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:07:55,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:07:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:55,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:07:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:55,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:07:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:55,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:07:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:55,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 13:07:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 13:07:55,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:07:55,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547217040] [2024-11-07 13:07:55,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547217040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:07:55,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:07:55,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 13:07:55,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800409282] [2024-11-07 13:07:55,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:07:55,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 13:07:55,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:07:55,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 13:07:55,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 13:07:55,772 INFO L87 Difference]: Start difference. First operand 565 states and 768 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 13:07:56,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:07:56,418 INFO L93 Difference]: Finished difference Result 624 states and 851 transitions. [2024-11-07 13:07:56,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 13:07:56,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2024-11-07 13:07:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:07:56,424 INFO L225 Difference]: With dead ends: 624 [2024-11-07 13:07:56,425 INFO L226 Difference]: Without dead ends: 620 [2024-11-07 13:07:56,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 13:07:56,426 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 159 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 13:07:56,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 822 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 13:07:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-07 13:07:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 566. [2024-11-07 13:07:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 429 states have (on average 1.358974358974359) internal successors, (583), 437 states have internal predecessors, (583), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-07 13:07:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 768 transitions. [2024-11-07 13:07:56,492 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 768 transitions. Word has length 57 [2024-11-07 13:07:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:07:56,493 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 768 transitions. [2024-11-07 13:07:56,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 13:07:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 768 transitions. [2024-11-07 13:07:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 13:07:56,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:07:56,497 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:07:56,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 13:07:56,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:07:56,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:07:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1070037838, now seen corresponding path program 1 times [2024-11-07 13:07:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:07:56,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618094233] [2024-11-07 13:07:56,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:07:56,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:07:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:56,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:07:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:56,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:07:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:07:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:56,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 13:07:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 13:07:56,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:07:56,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618094233] [2024-11-07 13:07:56,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618094233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:07:56,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:07:56,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 13:07:56,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507588791] [2024-11-07 13:07:56,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:07:56,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 13:07:56,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:07:56,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 13:07:56,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 13:07:56,812 INFO L87 Difference]: Start difference. First operand 566 states and 768 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 13:07:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:07:57,908 INFO L93 Difference]: Finished difference Result 1689 states and 2353 transitions. [2024-11-07 13:07:57,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 13:07:57,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 59 [2024-11-07 13:07:57,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:07:57,916 INFO L225 Difference]: With dead ends: 1689 [2024-11-07 13:07:57,916 INFO L226 Difference]: Without dead ends: 1112 [2024-11-07 13:07:57,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 13:07:57,918 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 687 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 13:07:57,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1066 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 13:07:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2024-11-07 13:07:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1008. [2024-11-07 13:07:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 774 states have (on average 1.3888888888888888) internal successors, (1075), 790 states have internal predecessors, (1075), 162 states have call successors, (162), 71 states have call predecessors, (162), 71 states have return successors, (166), 156 states have call predecessors, (166), 157 states have call successors, (166) [2024-11-07 13:07:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1403 transitions. [2024-11-07 13:07:58,025 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1403 transitions. Word has length 59 [2024-11-07 13:07:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:07:58,025 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1403 transitions. [2024-11-07 13:07:58,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 13:07:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1403 transitions. [2024-11-07 13:07:58,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 13:07:58,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:07:58,035 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 13:07:58,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 13:07:58,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:07:58,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:07:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1679775061, now seen corresponding path program 1 times [2024-11-07 13:07:58,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:07:58,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542757361] [2024-11-07 13:07:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:07:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:07:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:07:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:07:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:58,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:07:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:58,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 13:07:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:58,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:07:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:58,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 13:07:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 13:07:58,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:07:58,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542757361] [2024-11-07 13:07:58,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542757361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:07:58,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:07:58,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 13:07:58,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473746355] [2024-11-07 13:07:58,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:07:58,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 13:07:58,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:07:58,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 13:07:58,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 13:07:58,209 INFO L87 Difference]: Start difference. First operand 1008 states and 1403 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 13:07:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:07:59,643 INFO L93 Difference]: Finished difference Result 3014 states and 4195 transitions. [2024-11-07 13:07:59,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 13:07:59,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 74 [2024-11-07 13:07:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:07:59,657 INFO L225 Difference]: With dead ends: 3014 [2024-11-07 13:07:59,657 INFO L226 Difference]: Without dead ends: 2026 [2024-11-07 13:07:59,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 13:07:59,661 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1322 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 13:07:59,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 958 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 13:07:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2024-11-07 13:07:59,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1789. [2024-11-07 13:07:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1378 states have (on average 1.3911465892597967) internal successors, (1917), 1406 states have internal predecessors, (1917), 283 states have call successors, (283), 130 states have call predecessors, (283), 127 states have return successors, (282), 272 states have call predecessors, (282), 278 states have call successors, (282) [2024-11-07 13:07:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2482 transitions. [2024-11-07 13:07:59,834 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2482 transitions. Word has length 74 [2024-11-07 13:07:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:07:59,834 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 2482 transitions. [2024-11-07 13:07:59,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 13:07:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2482 transitions. [2024-11-07 13:07:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 13:07:59,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:07:59,840 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 13:07:59,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 13:07:59,840 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:07:59,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:07:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash -78255652, now seen corresponding path program 1 times [2024-11-07 13:07:59,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:07:59,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928347126] [2024-11-07 13:07:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:07:59,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:07:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:59,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:07:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:59,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:07:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:59,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:07:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:59,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 13:07:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:59,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:07:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:59,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 13:07:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:07:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 13:07:59,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:07:59,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928347126] [2024-11-07 13:07:59,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928347126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:07:59,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:07:59,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 13:07:59,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107595140] [2024-11-07 13:07:59,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:07:59,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 13:07:59,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:08:00,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 13:08:00,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 13:08:00,002 INFO L87 Difference]: Start difference. First operand 1789 states and 2482 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 13:08:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:08:00,884 INFO L93 Difference]: Finished difference Result 3760 states and 5234 transitions. [2024-11-07 13:08:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 13:08:00,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2024-11-07 13:08:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:08:00,898 INFO L225 Difference]: With dead ends: 3760 [2024-11-07 13:08:00,898 INFO L226 Difference]: Without dead ends: 1991 [2024-11-07 13:08:00,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 13:08:00,904 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 512 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 13:08:00,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 964 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 13:08:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2024-11-07 13:08:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1793. [2024-11-07 13:08:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1382 states have (on average 1.390014471780029) internal successors, (1921), 1410 states have internal predecessors, (1921), 283 states have call successors, (283), 130 states have call predecessors, (283), 127 states have return successors, (282), 272 states have call predecessors, (282), 278 states have call successors, (282) [2024-11-07 13:08:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2486 transitions. [2024-11-07 13:08:01,015 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2486 transitions. Word has length 78 [2024-11-07 13:08:01,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:08:01,016 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2486 transitions. [2024-11-07 13:08:01,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 13:08:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2486 transitions. [2024-11-07 13:08:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 13:08:01,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:08:01,022 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 13:08:01,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 13:08:01,023 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:08:01,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:08:01,023 INFO L85 PathProgramCache]: Analyzing trace with hash -93774370, now seen corresponding path program 1 times [2024-11-07 13:08:01,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:08:01,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656415130] [2024-11-07 13:08:01,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:08:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:08:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:01,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:08:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:01,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:01,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:08:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 13:08:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:01,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:01,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 13:08:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 13:08:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:08:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656415130] [2024-11-07 13:08:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656415130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:08:01,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:08:01,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 13:08:01,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330078759] [2024-11-07 13:08:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:08:01,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 13:08:01,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:08:01,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 13:08:01,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 13:08:01,217 INFO L87 Difference]: Start difference. First operand 1793 states and 2486 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 13:08:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:08:02,228 INFO L93 Difference]: Finished difference Result 3776 states and 5250 transitions. [2024-11-07 13:08:02,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 13:08:02,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2024-11-07 13:08:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:08:02,242 INFO L225 Difference]: With dead ends: 3776 [2024-11-07 13:08:02,242 INFO L226 Difference]: Without dead ends: 1943 [2024-11-07 13:08:02,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 13:08:02,248 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 497 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 13:08:02,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1210 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 13:08:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-11-07 13:08:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1741. [2024-11-07 13:08:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1350 states have (on average 1.3903703703703705) internal successors, (1877), 1378 states have internal predecessors, (1877), 263 states have call successors, (263), 130 states have call predecessors, (263), 127 states have return successors, (262), 252 states have call predecessors, (262), 258 states have call successors, (262) [2024-11-07 13:08:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2402 transitions. [2024-11-07 13:08:02,390 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2402 transitions. Word has length 78 [2024-11-07 13:08:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:08:02,391 INFO L471 AbstractCegarLoop]: Abstraction has 1741 states and 2402 transitions. [2024-11-07 13:08:02,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 13:08:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2402 transitions. [2024-11-07 13:08:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 13:08:02,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:08:02,393 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 13:08:02,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 13:08:02,393 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:08:02,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:08:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1018381759, now seen corresponding path program 1 times [2024-11-07 13:08:02,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:08:02,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172592768] [2024-11-07 13:08:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:08:02,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:08:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:02,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:08:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:02,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:08:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:02,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 13:08:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:02,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 13:08:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 13:08:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:08:02,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172592768] [2024-11-07 13:08:02,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172592768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:08:02,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:08:02,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 13:08:02,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187570784] [2024-11-07 13:08:02,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:08:02,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 13:08:02,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:08:02,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 13:08:02,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 13:08:02,507 INFO L87 Difference]: Start difference. First operand 1741 states and 2402 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 13:08:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:08:03,673 INFO L93 Difference]: Finished difference Result 5282 states and 7290 transitions. [2024-11-07 13:08:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 13:08:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 80 [2024-11-07 13:08:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:08:03,693 INFO L225 Difference]: With dead ends: 5282 [2024-11-07 13:08:03,694 INFO L226 Difference]: Without dead ends: 3561 [2024-11-07 13:08:03,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 13:08:03,700 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 966 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 13:08:03,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 1009 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 13:08:03,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2024-11-07 13:08:03,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3132. [2024-11-07 13:08:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 2426 states have (on average 1.3845836768342952) internal successors, (3359), 2478 states have internal predecessors, (3359), 468 states have call successors, (468), 238 states have call predecessors, (468), 237 states have return successors, (471), 451 states have call predecessors, (471), 463 states have call successors, (471) [2024-11-07 13:08:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 4298 transitions. [2024-11-07 13:08:03,916 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 4298 transitions. Word has length 80 [2024-11-07 13:08:03,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:08:03,917 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 4298 transitions. [2024-11-07 13:08:03,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 13:08:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 4298 transitions. [2024-11-07 13:08:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 13:08:03,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:08:03,925 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 13:08:03,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 13:08:03,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:08:03,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:08:03,926 INFO L85 PathProgramCache]: Analyzing trace with hash 243723226, now seen corresponding path program 1 times [2024-11-07 13:08:03,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:08:03,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920109185] [2024-11-07 13:08:03,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:08:03,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:08:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:08:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:08:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 13:08:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 13:08:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 13:08:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 13:08:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 13:08:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 13:08:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 13:08:04,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:08:04,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920109185] [2024-11-07 13:08:04,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920109185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:08:04,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:08:04,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 13:08:04,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968486619] [2024-11-07 13:08:04,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:08:04,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 13:08:04,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:08:04,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 13:08:04,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 13:08:04,215 INFO L87 Difference]: Start difference. First operand 3132 states and 4298 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 13:08:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:08:06,164 INFO L93 Difference]: Finished difference Result 8537 states and 11810 transitions. [2024-11-07 13:08:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 13:08:06,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2024-11-07 13:08:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:08:06,196 INFO L225 Difference]: With dead ends: 8537 [2024-11-07 13:08:06,196 INFO L226 Difference]: Without dead ends: 5425 [2024-11-07 13:08:06,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-07 13:08:06,207 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1168 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 13:08:06,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 1634 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 13:08:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5425 states. [2024-11-07 13:08:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5425 to 4704. [2024-11-07 13:08:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4704 states, 3662 states have (on average 1.3798470780993992) internal successors, (5053), 3742 states have internal predecessors, (5053), 687 states have call successors, (687), 353 states have call predecessors, (687), 354 states have return successors, (694), 664 states have call predecessors, (694), 682 states have call successors, (694) [2024-11-07 13:08:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4704 states to 4704 states and 6434 transitions. [2024-11-07 13:08:06,585 INFO L78 Accepts]: Start accepts. Automaton has 4704 states and 6434 transitions. Word has length 129 [2024-11-07 13:08:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:08:06,587 INFO L471 AbstractCegarLoop]: Abstraction has 4704 states and 6434 transitions. [2024-11-07 13:08:06,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 13:08:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4704 states and 6434 transitions. [2024-11-07 13:08:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 13:08:06,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:08:06,595 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 13:08:06,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 13:08:06,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:08:06,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:08:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1322906640, now seen corresponding path program 1 times [2024-11-07 13:08:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:08:06,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573166210] [2024-11-07 13:08:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:08:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:08:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:08:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:08:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 13:08:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 13:08:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 13:08:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 13:08:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 13:08:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 13:08:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 13:08:06,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:08:06,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573166210] [2024-11-07 13:08:06,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573166210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:08:06,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:08:06,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 13:08:06,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141814267] [2024-11-07 13:08:06,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:08:06,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 13:08:06,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:08:06,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 13:08:06,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 13:08:06,837 INFO L87 Difference]: Start difference. First operand 4704 states and 6434 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 13:08:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:08:09,149 INFO L93 Difference]: Finished difference Result 12798 states and 17655 transitions. [2024-11-07 13:08:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 13:08:09,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 135 [2024-11-07 13:08:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:08:09,193 INFO L225 Difference]: With dead ends: 12798 [2024-11-07 13:08:09,194 INFO L226 Difference]: Without dead ends: 8114 [2024-11-07 13:08:09,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-07 13:08:09,207 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 961 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 13:08:09,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1939 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 13:08:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8114 states. [2024-11-07 13:08:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8114 to 7055. [2024-11-07 13:08:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7055 states, 5518 states have (on average 1.3754983689742661) internal successors, (7590), 5640 states have internal predecessors, (7590), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 528 states have return successors, (1021), 976 states have call predecessors, (1021), 1003 states have call successors, (1021) [2024-11-07 13:08:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7055 states to 7055 states and 9619 transitions. [2024-11-07 13:08:09,741 INFO L78 Accepts]: Start accepts. Automaton has 7055 states and 9619 transitions. Word has length 135 [2024-11-07 13:08:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:08:09,742 INFO L471 AbstractCegarLoop]: Abstraction has 7055 states and 9619 transitions. [2024-11-07 13:08:09,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 13:08:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 7055 states and 9619 transitions. [2024-11-07 13:08:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 13:08:09,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:08:09,752 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 13:08:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 13:08:09,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:08:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:08:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1780472740, now seen corresponding path program 1 times [2024-11-07 13:08:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:08:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505551158] [2024-11-07 13:08:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:08:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:08:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:09,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:08:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:09,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:09,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:08:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 13:08:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:09,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 13:08:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:09,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:09,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 13:08:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:10,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 13:08:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:10,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 13:08:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:10,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:10,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 13:08:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 13:08:10,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:08:10,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505551158] [2024-11-07 13:08:10,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505551158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 13:08:10,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22713742] [2024-11-07 13:08:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:08:10,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 13:08:10,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 13:08:10,073 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 13:08:10,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 13:08:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:10,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 13:08:10,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 13:08:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-07 13:08:10,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 13:08:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22713742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:08:10,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 13:08:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-07 13:08:10,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120619781] [2024-11-07 13:08:10,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:08:10,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 13:08:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:08:10,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 13:08:10,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 13:08:10,565 INFO L87 Difference]: Start difference. First operand 7055 states and 9619 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 13:08:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:08:11,011 INFO L93 Difference]: Finished difference Result 14198 states and 19377 transitions. [2024-11-07 13:08:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 13:08:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 139 [2024-11-07 13:08:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:08:11,051 INFO L225 Difference]: With dead ends: 14198 [2024-11-07 13:08:11,051 INFO L226 Difference]: Without dead ends: 7001 [2024-11-07 13:08:11,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 13:08:11,071 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 1 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 13:08:11,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1891 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 13:08:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7001 states. [2024-11-07 13:08:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7001 to 7001. [2024-11-07 13:08:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7001 states, 5464 states have (on average 1.3726207906295753) internal successors, (7500), 5595 states have internal predecessors, (7500), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 528 states have return successors, (1012), 967 states have call predecessors, (1012), 994 states have call successors, (1012) [2024-11-07 13:08:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7001 states to 7001 states and 9520 transitions. [2024-11-07 13:08:11,753 INFO L78 Accepts]: Start accepts. Automaton has 7001 states and 9520 transitions. Word has length 139 [2024-11-07 13:08:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:08:11,753 INFO L471 AbstractCegarLoop]: Abstraction has 7001 states and 9520 transitions. [2024-11-07 13:08:11,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 13:08:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7001 states and 9520 transitions. [2024-11-07 13:08:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 13:08:11,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:08:11,765 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 13:08:11,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 13:08:11,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 13:08:11,970 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:08:11,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:08:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1790675275, now seen corresponding path program 1 times [2024-11-07 13:08:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:08:11,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895787858] [2024-11-07 13:08:11,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:08:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:08:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:08:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:08:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 13:08:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 13:08:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 13:08:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 13:08:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 13:08:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 13:08:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-07 13:08:12,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:08:12,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895787858] [2024-11-07 13:08:12,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895787858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:08:12,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:08:12,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 13:08:12,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410080362] [2024-11-07 13:08:12,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:08:12,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 13:08:12,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:08:12,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 13:08:12,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 13:08:12,244 INFO L87 Difference]: Start difference. First operand 7001 states and 9520 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 13:08:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:08:13,498 INFO L93 Difference]: Finished difference Result 14960 states and 20448 transitions. [2024-11-07 13:08:13,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 13:08:13,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 141 [2024-11-07 13:08:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:08:13,530 INFO L225 Difference]: With dead ends: 14960 [2024-11-07 13:08:13,530 INFO L226 Difference]: Without dead ends: 7979 [2024-11-07 13:08:13,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-07 13:08:13,547 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 899 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 13:08:13,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1062 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 13:08:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7979 states. [2024-11-07 13:08:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7979 to 6965. [2024-11-07 13:08:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6965 states, 5428 states have (on average 1.3684598378776713) internal successors, (7428), 5559 states have internal predecessors, (7428), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 528 states have return successors, (1012), 967 states have call predecessors, (1012), 994 states have call successors, (1012) [2024-11-07 13:08:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 9448 transitions. [2024-11-07 13:08:14,086 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 9448 transitions. Word has length 141 [2024-11-07 13:08:14,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:08:14,086 INFO L471 AbstractCegarLoop]: Abstraction has 6965 states and 9448 transitions. [2024-11-07 13:08:14,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 13:08:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 9448 transitions. [2024-11-07 13:08:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 13:08:14,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:08:14,096 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 13:08:14,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 13:08:14,097 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:08:14,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:08:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1600459861, now seen corresponding path program 1 times [2024-11-07 13:08:14,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:08:14,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390685318] [2024-11-07 13:08:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:08:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:08:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:08:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:08:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 13:08:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 13:08:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 13:08:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 13:08:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 13:08:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 13:08:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 13:08:14,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:08:14,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390685318] [2024-11-07 13:08:14,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390685318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 13:08:14,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046411893] [2024-11-07 13:08:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:08:14,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 13:08:14,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 13:08:14,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 13:08:14,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 13:08:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:14,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 13:08:14,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 13:08:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 13:08:14,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 13:08:14,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046411893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:08:14,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 13:08:14,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2024-11-07 13:08:14,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385329983] [2024-11-07 13:08:14,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:08:14,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 13:08:14,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:08:14,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 13:08:14,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 13:08:14,937 INFO L87 Difference]: Start difference. First operand 6965 states and 9448 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-07 13:08:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:08:16,558 INFO L93 Difference]: Finished difference Result 20826 states and 28263 transitions. [2024-11-07 13:08:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 13:08:16,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 142 [2024-11-07 13:08:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:08:16,662 INFO L225 Difference]: With dead ends: 20826 [2024-11-07 13:08:16,662 INFO L226 Difference]: Without dead ends: 20791 [2024-11-07 13:08:16,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 13:08:16,680 INFO L432 NwaCegarLoop]: 850 mSDtfsCounter, 866 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 13:08:16,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1649 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 13:08:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20791 states. [2024-11-07 13:08:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20791 to 20641. [2024-11-07 13:08:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20641 states, 16064 states have (on average 1.3723232071713147) internal successors, (22045), 16457 states have internal predecessors, (22045), 3000 states have call successors, (3000), 1554 states have call predecessors, (3000), 1576 states have return successors, (3022), 2887 states have call predecessors, (3022), 2968 states have call successors, (3022) [2024-11-07 13:08:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20641 states to 20641 states and 28067 transitions. [2024-11-07 13:08:18,113 INFO L78 Accepts]: Start accepts. Automaton has 20641 states and 28067 transitions. Word has length 142 [2024-11-07 13:08:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:08:18,114 INFO L471 AbstractCegarLoop]: Abstraction has 20641 states and 28067 transitions. [2024-11-07 13:08:18,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-07 13:08:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 20641 states and 28067 transitions. [2024-11-07 13:08:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 13:08:18,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:08:18,139 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 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, 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-07 13:08:18,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 13:08:18,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 13:08:18,340 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:08:18,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:08:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash -617781953, now seen corresponding path program 1 times [2024-11-07 13:08:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:08:18,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666509555] [2024-11-07 13:08:18,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:08:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:08:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:08:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:08:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 13:08:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 13:08:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 13:08:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 13:08:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 13:08:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 13:08:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-07 13:08:18,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:08:18,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666509555] [2024-11-07 13:08:18,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666509555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:08:18,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:08:18,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 13:08:18,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613123038] [2024-11-07 13:08:18,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:08:18,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 13:08:18,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:08:18,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 13:08:18,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 13:08:18,609 INFO L87 Difference]: Start difference. First operand 20641 states and 28067 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 13:08:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:08:20,055 INFO L93 Difference]: Finished difference Result 27346 states and 37410 transitions. [2024-11-07 13:08:20,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 13:08:20,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 151 [2024-11-07 13:08:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:08:20,087 INFO L225 Difference]: With dead ends: 27346 [2024-11-07 13:08:20,088 INFO L226 Difference]: Without dead ends: 6538 [2024-11-07 13:08:20,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-07 13:08:20,133 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1048 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 13:08:20,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 932 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 13:08:20,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2024-11-07 13:08:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6358. [2024-11-07 13:08:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6358 states, 5090 states have (on average 1.4011787819253438) internal successors, (7132), 5204 states have internal predecessors, (7132), 804 states have call successors, (804), 468 states have call predecessors, (804), 463 states have return successors, (799), 790 states have call predecessors, (799), 799 states have call successors, (799) [2024-11-07 13:08:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6358 states to 6358 states and 8735 transitions. [2024-11-07 13:08:20,566 INFO L78 Accepts]: Start accepts. Automaton has 6358 states and 8735 transitions. Word has length 151 [2024-11-07 13:08:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:08:20,567 INFO L471 AbstractCegarLoop]: Abstraction has 6358 states and 8735 transitions. [2024-11-07 13:08:20,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 13:08:20,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6358 states and 8735 transitions. [2024-11-07 13:08:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 13:08:20,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:08:20,581 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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-07 13:08:20,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 13:08:20,581 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:08:20,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:08:20,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2059787437, now seen corresponding path program 1 times [2024-11-07 13:08:20,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:08:20,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305793861] [2024-11-07 13:08:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:08:20,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:08:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:08:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:08:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 13:08:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 13:08:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 13:08:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 13:08:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 13:08:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 13:08:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-07 13:08:20,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:08:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305793861] [2024-11-07 13:08:20,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305793861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:08:20,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:08:20,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 13:08:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988251771] [2024-11-07 13:08:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:08:20,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 13:08:20,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:08:20,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 13:08:20,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 13:08:20,913 INFO L87 Difference]: Start difference. First operand 6358 states and 8735 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 13:08:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:08:22,472 INFO L93 Difference]: Finished difference Result 12921 states and 17780 transitions. [2024-11-07 13:08:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 13:08:22,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 151 [2024-11-07 13:08:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:08:22,506 INFO L225 Difference]: With dead ends: 12921 [2024-11-07 13:08:22,506 INFO L226 Difference]: Without dead ends: 6583 [2024-11-07 13:08:22,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 13:08:22,517 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 696 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 13:08:22,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 999 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 13:08:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6583 states. [2024-11-07 13:08:23,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6583 to 6361. [2024-11-07 13:08:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6361 states, 5093 states have (on average 1.4009424700569408) internal successors, (7135), 5207 states have internal predecessors, (7135), 804 states have call successors, (804), 468 states have call predecessors, (804), 463 states have return successors, (799), 790 states have call predecessors, (799), 799 states have call successors, (799) [2024-11-07 13:08:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 8738 transitions. [2024-11-07 13:08:23,165 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 8738 transitions. Word has length 151 [2024-11-07 13:08:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:08:23,166 INFO L471 AbstractCegarLoop]: Abstraction has 6361 states and 8738 transitions. [2024-11-07 13:08:23,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 13:08:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 8738 transitions. [2024-11-07 13:08:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 13:08:23,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 13:08:23,183 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:08:23,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 13:08:23,184 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 13:08:23,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 13:08:23,184 INFO L85 PathProgramCache]: Analyzing trace with hash -948182894, now seen corresponding path program 1 times [2024-11-07 13:08:23,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 13:08:23,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579287677] [2024-11-07 13:08:23,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 13:08:23,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 13:08:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 13:08:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 13:08:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 13:08:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 13:08:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 13:08:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 13:08:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 13:08:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 13:08:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 13:08:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 13:08:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 13:08:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-07 13:08:23,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 13:08:23,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579287677] [2024-11-07 13:08:23,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579287677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 13:08:23,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 13:08:23,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 13:08:23,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505239034] [2024-11-07 13:08:23,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 13:08:23,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 13:08:23,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 13:08:23,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 13:08:23,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 13:08:23,812 INFO L87 Difference]: Start difference. First operand 6361 states and 8738 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 13:08:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 13:08:25,252 INFO L93 Difference]: Finished difference Result 7138 states and 9754 transitions. [2024-11-07 13:08:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 13:08:25,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 153 [2024-11-07 13:08:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 13:08:25,265 INFO L225 Difference]: With dead ends: 7138 [2024-11-07 13:08:25,266 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 13:08:25,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-07 13:08:25,278 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 659 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 13:08:25,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 689 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 13:08:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 13:08:25,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 13:08:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 13:08:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 13:08:25,290 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2024-11-07 13:08:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 13:08:25,290 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 13:08:25,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 13:08:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 13:08:25,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 13:08:25,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 13:08:25,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 13:08:25,296 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 13:08:25,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.