./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 15:22:45,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 15:22:45,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 15:22:45,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 15:22:45,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 15:22:46,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 15:22:46,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 15:22:46,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 15:22:46,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 15:22:46,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 15:22:46,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 15:22:46,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 15:22:46,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 15:22:46,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 15:22:46,027 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 15:22:46,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 15:22:46,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 15:22:46,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 15:22:46,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 15:22:46,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 15:22:46,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 15:22:46,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 15:22:46,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 15:22:46,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 15:22:46,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 15:22:46,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 15:22:46,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 15:22:46,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 15:22:46,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 15:22:46,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 15:22:46,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 15:22:46,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 15:22:46,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 15:22:46,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 15:22:46,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 15:22:46,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 15:22:46,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 15:22:46,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 15:22:46,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 15:22:46,037 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 [2024-10-14 15:22:46,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 15:22:46,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 15:22:46,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 15:22:46,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 15:22:46,337 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 15:22:46,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2024-10-14 15:22:47,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 15:22:48,193 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 15:22:48,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2024-10-14 15:22:48,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0fc5f44f/4b6266003ca14aca94054bae2b51dd6c/FLAG3f291d815 [2024-10-14 15:22:48,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0fc5f44f/4b6266003ca14aca94054bae2b51dd6c [2024-10-14 15:22:48,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 15:22:48,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 15:22:48,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 15:22:48,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 15:22:48,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 15:22:48,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:22:48" (1/1) ... [2024-10-14 15:22:48,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9421b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:48, skipping insertion in model container [2024-10-14 15:22:48,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:22:48" (1/1) ... [2024-10-14 15:22:48,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 15:22:49,050 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2024-10-14 15:22:49,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 15:22:49,314 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 15:22:49,511 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2024-10-14 15:22:49,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 15:22:49,616 INFO L204 MainTranslator]: Completed translation [2024-10-14 15:22:49,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49 WrapperNode [2024-10-14 15:22:49,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 15:22:49,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 15:22:49,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 15:22:49,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 15:22:49,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (1/1) ... [2024-10-14 15:22:49,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (1/1) ... [2024-10-14 15:22:49,742 INFO L138 Inliner]: procedures = 102, calls = 322, calls flagged for inlining = 36, calls inlined = 33, statements flattened = 1053 [2024-10-14 15:22:49,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 15:22:49,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 15:22:49,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 15:22:49,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 15:22:49,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (1/1) ... [2024-10-14 15:22:49,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (1/1) ... [2024-10-14 15:22:49,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (1/1) ... [2024-10-14 15:22:49,859 INFO L175 MemorySlicer]: Split 165 memory accesses to 10 slices as follows [2, 17, 42, 3, 2, 79, 2, 3, 14, 1]. 48 percent of accesses are in the largest equivalence class. The 63 initializations are split as follows [2, 17, 42, 0, 0, 2, 0, 0, 0, 0]. The 38 writes are split as follows [0, 0, 0, 1, 1, 19, 0, 2, 14, 1]. [2024-10-14 15:22:49,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (1/1) ... [2024-10-14 15:22:49,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (1/1) ... [2024-10-14 15:22:49,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (1/1) ... [2024-10-14 15:22:49,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (1/1) ... [2024-10-14 15:22:49,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (1/1) ... [2024-10-14 15:22:49,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (1/1) ... [2024-10-14 15:22:49,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 15:22:49,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 15:22:49,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 15:22:49,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 15:22:49,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (1/1) ... [2024-10-14 15:22:50,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 15:22:50,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:22:50,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 15:22:50,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 15:22:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-14 15:22:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-14 15:22:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-14 15:22:50,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-14 15:22:50,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-14 15:22:50,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-14 15:22:50,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-14 15:22:50,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-14 15:22:50,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-14 15:22:50,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-14 15:22:50,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-14 15:22:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-14 15:22:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-14 15:22:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-14 15:22:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-14 15:22:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-14 15:22:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-14 15:22:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-14 15:22:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-10-14 15:22:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-10-14 15:22:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-14 15:22:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-14 15:22:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-14 15:22:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-14 15:22:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-14 15:22:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-14 15:22:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-14 15:22:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-14 15:22:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-10-14 15:22:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-10-14 15:22:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2024-10-14 15:22:50,099 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2024-10-14 15:22:50,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-14 15:22:50,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-14 15:22:50,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 15:22:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 15:22:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 15:22:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 15:22:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 15:22:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 15:22:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 15:22:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-14 15:22:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-14 15:22:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-14 15:22:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_tx_fixup [2024-10-14 15:22:50,102 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_tx_fixup [2024-10-14 15:22:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2024-10-14 15:22:50,102 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2024-10-14 15:22:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-10-14 15:22:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-10-14 15:22:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2024-10-14 15:22:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2024-10-14 15:22:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2024-10-14 15:22:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2024-10-14 15:22:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2024-10-14 15:22:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2024-10-14 15:22:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2024-10-14 15:22:50,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2024-10-14 15:22:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-10-14 15:22:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-10-14 15:22:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2024-10-14 15:22:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2024-10-14 15:22:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2024-10-14 15:22:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2024-10-14 15:22:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2024-10-14 15:22:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2024-10-14 15:22:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2024-10-14 15:22:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2024-10-14 15:22:50,103 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-14 15:22:50,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-14 15:22:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-14 15:22:50,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-14 15:22:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_rx_fixup [2024-10-14 15:22:50,104 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_rx_fixup [2024-10-14 15:22:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2024-10-14 15:22:50,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2024-10-14 15:22:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2024-10-14 15:22:50,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2024-10-14 15:22:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-14 15:22:50,104 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-14 15:22:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 15:22:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 15:22:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 15:22:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 15:22:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 15:22:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 15:22:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 15:22:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-14 15:22:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-14 15:22:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-14 15:22:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-14 15:22:50,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-14 15:22:50,107 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2024-10-14 15:22:50,107 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2024-10-14 15:22:50,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 15:22:50,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 15:22:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 15:22:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-10-14 15:22:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-10-14 15:22:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-10-14 15:22:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-10-14 15:22:50,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2024-10-14 15:22:50,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2024-10-14 15:22:50,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2024-10-14 15:22:50,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 15:22:50,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 15:22:50,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 15:22:50,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-10-14 15:22:50,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-10-14 15:22:50,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-10-14 15:22:50,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-10-14 15:22:50,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2024-10-14 15:22:50,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2024-10-14 15:22:50,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2024-10-14 15:22:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_skb_return [2024-10-14 15:22:50,111 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_skb_return [2024-10-14 15:22:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 15:22:50,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 15:22:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 15:22:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 15:22:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 15:22:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 15:22:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 15:22:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-14 15:22:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-14 15:22:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-14 15:22:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-14 15:22:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-14 15:22:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-14 15:22:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-14 15:22:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 15:22:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 15:22:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 15:22:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 15:22:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-14 15:22:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-14 15:22:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-14 15:22:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-14 15:22:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-14 15:22:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-14 15:22:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-14 15:22:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 15:22:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 15:22:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 15:22:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 15:22:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-14 15:22:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-14 15:22:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-14 15:22:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-14 15:22:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-14 15:22:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-14 15:22:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-14 15:22:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2024-10-14 15:22:50,116 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2024-10-14 15:22:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-14 15:22:50,116 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-14 15:22:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-14 15:22:50,116 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-14 15:22:50,116 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_cmd [2024-10-14 15:22:50,117 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_cmd [2024-10-14 15:22:50,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 15:22:50,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 15:22:50,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 15:22:50,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 15:22:50,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 15:22:50,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 15:22:50,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 15:22:50,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 15:22:50,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 15:22:50,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 15:22:50,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-14 15:22:50,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-14 15:22:50,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-14 15:22:50,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-14 15:22:50,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-14 15:22:50,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-14 15:22:50,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-14 15:22:50,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-14 15:22:50,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-10-14 15:22:50,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-10-14 15:22:50,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-14 15:22:50,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-14 15:22:50,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 15:22:50,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 15:22:50,530 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 15:22:50,534 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 15:22:50,585 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-14 15:22:52,455 INFO L? ?]: Removed 592 outVars from TransFormulas that were not future-live. [2024-10-14 15:22:52,455 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 15:22:52,552 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 15:22:52,552 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 15:22:52,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:22:52 BoogieIcfgContainer [2024-10-14 15:22:52,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 15:22:52,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 15:22:52,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 15:22:52,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 15:22:52,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:22:48" (1/3) ... [2024-10-14 15:22:52,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61768a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:22:52, skipping insertion in model container [2024-10-14 15:22:52,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:49" (2/3) ... [2024-10-14 15:22:52,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61768a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:22:52, skipping insertion in model container [2024-10-14 15:22:52,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:22:52" (3/3) ... [2024-10-14 15:22:52,562 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2024-10-14 15:22:52,579 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 15:22:52,579 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 15:22:52,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 15:22:52,678 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;@73569fed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 15:22:52,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 15:22:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 292 states, 205 states have (on average 1.473170731707317) internal successors, (302), 211 states have internal predecessors, (302), 63 states have call successors, (63), 23 states have call predecessors, (63), 22 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-14 15:22:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 15:22:52,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:22:52,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:22:52,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:22:52,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:22:52,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1202566390, now seen corresponding path program 1 times [2024-10-14 15:22:52,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:22:52,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285174698] [2024-10-14 15:22:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:22:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:22:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:22:53,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:22:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:22:53,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:22:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:22:53,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:22:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:22:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 15:22:53,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:22:53,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285174698] [2024-10-14 15:22:53,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285174698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:22:53,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:22:53,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 15:22:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391756719] [2024-10-14 15:22:53,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:22:53,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 15:22:53,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:22:53,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 15:22:53,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 15:22:53,381 INFO L87 Difference]: Start difference. First operand has 292 states, 205 states have (on average 1.473170731707317) internal successors, (302), 211 states have internal predecessors, (302), 63 states have call successors, (63), 23 states have call predecessors, (63), 22 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 15:22:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:22:57,448 INFO L93 Difference]: Finished difference Result 961 states and 1507 transitions. [2024-10-14 15:22:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 15:22:57,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-14 15:22:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:22:57,470 INFO L225 Difference]: With dead ends: 961 [2024-10-14 15:22:57,470 INFO L226 Difference]: Without dead ends: 659 [2024-10-14 15:22:57,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-14 15:22:57,486 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1364 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 761 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 15:22:57,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 628 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [761 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 15:22:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-10-14 15:22:57,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 541. [2024-10-14 15:22:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 390 states have (on average 1.4256410256410257) internal successors, (556), 390 states have internal predecessors, (556), 110 states have call successors, (110), 41 states have call predecessors, (110), 40 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2024-10-14 15:22:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 775 transitions. [2024-10-14 15:22:57,630 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 775 transitions. Word has length 27 [2024-10-14 15:22:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:22:57,631 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 775 transitions. [2024-10-14 15:22:57,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 15:22:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 775 transitions. [2024-10-14 15:22:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 15:22:57,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:22:57,635 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 15:22:57,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 15:22:57,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:22:57,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:22:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1846850748, now seen corresponding path program 1 times [2024-10-14 15:22:57,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:22:57,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667882334] [2024-10-14 15:22:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:22:57,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:22:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:22:57,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:22:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:22:57,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:22:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:22:57,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:22:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:22:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:22:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:22:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 15:22:57,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:22:57,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667882334] [2024-10-14 15:22:57,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667882334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:22:57,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:22:57,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 15:22:57,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146563597] [2024-10-14 15:22:57,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:22:57,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 15:22:57,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:22:57,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 15:22:57,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 15:22:57,958 INFO L87 Difference]: Start difference. First operand 541 states and 775 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 15:23:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:23:02,677 INFO L93 Difference]: Finished difference Result 1826 states and 2742 transitions. [2024-10-14 15:23:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 15:23:02,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-10-14 15:23:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:23:02,689 INFO L225 Difference]: With dead ends: 1826 [2024-10-14 15:23:02,690 INFO L226 Difference]: Without dead ends: 1296 [2024-10-14 15:23:02,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-14 15:23:02,695 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1339 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-14 15:23:02,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 766 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-14 15:23:02,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-10-14 15:23:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1064. [2024-10-14 15:23:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 769 states have (on average 1.422626788036411) internal successors, (1094), 769 states have internal predecessors, (1094), 216 states have call successors, (216), 79 states have call predecessors, (216), 78 states have return successors, (225), 215 states have call predecessors, (225), 215 states have call successors, (225) [2024-10-14 15:23:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1535 transitions. [2024-10-14 15:23:02,803 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1535 transitions. Word has length 36 [2024-10-14 15:23:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:23:02,804 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1535 transitions. [2024-10-14 15:23:02,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 15:23:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1535 transitions. [2024-10-14 15:23:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 15:23:02,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:23:02,816 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] [2024-10-14 15:23:02,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 15:23:02,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:23:02,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:23:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash -125638428, now seen corresponding path program 1 times [2024-10-14 15:23:02,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:23:02,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11236972] [2024-10-14 15:23:02,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:02,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:23:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:03,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:03,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:23:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:03,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:23:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:03,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 15:23:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:03,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:03,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:03,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 15:23:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 15:23:03,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:23:03,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11236972] [2024-10-14 15:23:03,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11236972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:23:03,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:23:03,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 15:23:03,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639451255] [2024-10-14 15:23:03,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:23:03,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 15:23:03,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:23:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 15:23:03,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:23:03,190 INFO L87 Difference]: Start difference. First operand 1064 states and 1535 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 15:23:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:23:06,699 INFO L93 Difference]: Finished difference Result 2594 states and 3856 transitions. [2024-10-14 15:23:06,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 15:23:06,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-10-14 15:23:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:23:06,711 INFO L225 Difference]: With dead ends: 2594 [2024-10-14 15:23:06,712 INFO L226 Difference]: Without dead ends: 1543 [2024-10-14 15:23:06,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-10-14 15:23:06,718 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 801 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:23:06,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 601 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 15:23:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-10-14 15:23:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1336. [2024-10-14 15:23:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1000 states have (on average 1.448) internal successors, (1448), 1004 states have internal predecessors, (1448), 235 states have call successors, (235), 89 states have call predecessors, (235), 100 states have return successors, (282), 242 states have call predecessors, (282), 234 states have call successors, (282) [2024-10-14 15:23:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1965 transitions. [2024-10-14 15:23:06,824 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1965 transitions. Word has length 73 [2024-10-14 15:23:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:23:06,825 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1965 transitions. [2024-10-14 15:23:06,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 15:23:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1965 transitions. [2024-10-14 15:23:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 15:23:06,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:23:06,833 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:23:06,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 15:23:06,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:23:06,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:23:06,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1094082276, now seen corresponding path program 1 times [2024-10-14 15:23:06,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:23:06,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316352311] [2024-10-14 15:23:06,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:06,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:23:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:07,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:07,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:23:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:07,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:23:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:07,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:23:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:07,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 15:23:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:07,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 15:23:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:07,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 15:23:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:07,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 15:23:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:07,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:07,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 15:23:07,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:23:07,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316352311] [2024-10-14 15:23:07,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316352311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:23:07,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:23:07,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 15:23:07,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897075355] [2024-10-14 15:23:07,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:23:07,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 15:23:07,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:23:07,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 15:23:07,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:23:07,265 INFO L87 Difference]: Start difference. First operand 1336 states and 1965 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 15:23:12,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:23:12,900 INFO L93 Difference]: Finished difference Result 3778 states and 5646 transitions. [2024-10-14 15:23:12,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 15:23:12,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2024-10-14 15:23:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:23:12,916 INFO L225 Difference]: With dead ends: 3778 [2024-10-14 15:23:12,917 INFO L226 Difference]: Without dead ends: 2465 [2024-10-14 15:23:12,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2024-10-14 15:23:12,922 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 1115 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 2149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-14 15:23:12,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 1055 Invalid, 2149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 1589 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-14 15:23:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2024-10-14 15:23:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2074. [2024-10-14 15:23:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1558 states have (on average 1.4351732991014121) internal successors, (2236), 1566 states have internal predecessors, (2236), 343 states have call successors, (343), 149 states have call predecessors, (343), 172 states have return successors, (425), 358 states have call predecessors, (425), 342 states have call successors, (425) [2024-10-14 15:23:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3004 transitions. [2024-10-14 15:23:13,076 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3004 transitions. Word has length 97 [2024-10-14 15:23:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:23:13,076 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3004 transitions. [2024-10-14 15:23:13,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 15:23:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3004 transitions. [2024-10-14 15:23:13,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 15:23:13,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:23:13,081 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:23:13,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 15:23:13,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:23:13,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:23:13,082 INFO L85 PathProgramCache]: Analyzing trace with hash 989418162, now seen corresponding path program 1 times [2024-10-14 15:23:13,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:23:13,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075461708] [2024-10-14 15:23:13,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:13,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:23:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:13,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:13,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:23:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:23:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:13,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:23:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:13,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 15:23:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:13,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 15:23:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:13,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 15:23:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:13,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 15:23:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:13,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:13,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-14 15:23:14,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:23:14,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075461708] [2024-10-14 15:23:14,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075461708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:23:14,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:23:14,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 15:23:14,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622413379] [2024-10-14 15:23:14,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:23:14,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 15:23:14,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:23:14,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 15:23:14,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-14 15:23:14,062 INFO L87 Difference]: Start difference. First operand 2074 states and 3004 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 15:23:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:23:21,076 INFO L93 Difference]: Finished difference Result 4511 states and 6685 transitions. [2024-10-14 15:23:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 15:23:21,077 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-10-14 15:23:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:23:21,095 INFO L225 Difference]: With dead ends: 4511 [2024-10-14 15:23:21,095 INFO L226 Difference]: Without dead ends: 2460 [2024-10-14 15:23:21,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2024-10-14 15:23:21,103 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 668 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 2821 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 3235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 2821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-14 15:23:21,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1512 Invalid, 3235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2821 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-14 15:23:21,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2024-10-14 15:23:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2154. [2024-10-14 15:23:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 1622 states have (on average 1.4254007398273736) internal successors, (2312), 1634 states have internal predecessors, (2312), 343 states have call successors, (343), 149 states have call predecessors, (343), 188 states have return successors, (450), 370 states have call predecessors, (450), 342 states have call successors, (450) [2024-10-14 15:23:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 3105 transitions. [2024-10-14 15:23:21,272 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 3105 transitions. Word has length 97 [2024-10-14 15:23:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:23:21,273 INFO L471 AbstractCegarLoop]: Abstraction has 2154 states and 3105 transitions. [2024-10-14 15:23:21,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 15:23:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3105 transitions. [2024-10-14 15:23:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 15:23:21,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:23:21,277 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:23:21,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 15:23:21,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:23:21,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:23:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1687667792, now seen corresponding path program 1 times [2024-10-14 15:23:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:23:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516617974] [2024-10-14 15:23:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:23:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:21,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:23:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:23:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:23:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:21,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 15:23:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 15:23:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:21,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 15:23:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:21,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 15:23:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:21,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:22,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-14 15:23:22,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:23:22,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516617974] [2024-10-14 15:23:22,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516617974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:23:22,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:23:22,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 15:23:22,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773419786] [2024-10-14 15:23:22,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:23:22,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 15:23:22,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:23:22,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 15:23:22,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-14 15:23:22,062 INFO L87 Difference]: Start difference. First operand 2154 states and 3105 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 15:23:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:23:28,413 INFO L93 Difference]: Finished difference Result 4599 states and 6774 transitions. [2024-10-14 15:23:28,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 15:23:28,413 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-10-14 15:23:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:23:28,431 INFO L225 Difference]: With dead ends: 4599 [2024-10-14 15:23:28,431 INFO L226 Difference]: Without dead ends: 2468 [2024-10-14 15:23:28,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2024-10-14 15:23:28,441 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 762 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 2730 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 3215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 2730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-14 15:23:28,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1415 Invalid, 3215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 2730 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-14 15:23:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2024-10-14 15:23:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2114. [2024-10-14 15:23:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 1586 states have (on average 1.4224464060529634) internal successors, (2256), 1598 states have internal predecessors, (2256), 343 states have call successors, (343), 149 states have call predecessors, (343), 184 states have return successors, (442), 366 states have call predecessors, (442), 342 states have call successors, (442) [2024-10-14 15:23:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3041 transitions. [2024-10-14 15:23:28,650 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3041 transitions. Word has length 103 [2024-10-14 15:23:28,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:23:28,651 INFO L471 AbstractCegarLoop]: Abstraction has 2114 states and 3041 transitions. [2024-10-14 15:23:28,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 15:23:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3041 transitions. [2024-10-14 15:23:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 15:23:28,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:23:28,654 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:23:28,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 15:23:28,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:23:28,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:23:28,655 INFO L85 PathProgramCache]: Analyzing trace with hash 254953735, now seen corresponding path program 1 times [2024-10-14 15:23:28,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:23:28,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69780507] [2024-10-14 15:23:28,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:28,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:23:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:28,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:23:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:23:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:28,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:23:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:28,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 15:23:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:28,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 15:23:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 15:23:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:29,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 15:23:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:29,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:29,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:29,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 15:23:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-14 15:23:29,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:23:29,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69780507] [2024-10-14 15:23:29,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69780507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:23:29,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:23:29,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 15:23:29,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809465083] [2024-10-14 15:23:29,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:23:29,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 15:23:29,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:23:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 15:23:29,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-14 15:23:29,424 INFO L87 Difference]: Start difference. First operand 2114 states and 3041 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 15:23:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:23:34,451 INFO L93 Difference]: Finished difference Result 4827 states and 7242 transitions. [2024-10-14 15:23:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 15:23:34,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-10-14 15:23:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:23:34,469 INFO L225 Difference]: With dead ends: 4827 [2024-10-14 15:23:34,470 INFO L226 Difference]: Without dead ends: 2736 [2024-10-14 15:23:34,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2024-10-14 15:23:34,480 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 675 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 15:23:34,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 985 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-14 15:23:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2024-10-14 15:23:34,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2182. [2024-10-14 15:23:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 1610 states have (on average 1.4062111801242236) internal successors, (2264), 1618 states have internal predecessors, (2264), 391 states have call successors, (391), 149 states have call predecessors, (391), 180 states have return successors, (502), 414 states have call predecessors, (502), 390 states have call successors, (502) [2024-10-14 15:23:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3157 transitions. [2024-10-14 15:23:34,718 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3157 transitions. Word has length 103 [2024-10-14 15:23:34,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:23:34,720 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 3157 transitions. [2024-10-14 15:23:34,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 15:23:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3157 transitions. [2024-10-14 15:23:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 15:23:34,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:23:34,724 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:23:34,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 15:23:34,724 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:23:34,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:23:34,725 INFO L85 PathProgramCache]: Analyzing trace with hash 121764741, now seen corresponding path program 1 times [2024-10-14 15:23:34,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:23:34,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186707760] [2024-10-14 15:23:34,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:34,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:23:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:23:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:23:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:23:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 15:23:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 15:23:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 15:23:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 15:23:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:23:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-14 15:23:35,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:23:35,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186707760] [2024-10-14 15:23:35,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186707760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:23:35,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:23:35,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 15:23:35,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337484179] [2024-10-14 15:23:35,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:23:35,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 15:23:35,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:23:35,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 15:23:35,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 15:23:35,274 INFO L87 Difference]: Start difference. First operand 2182 states and 3157 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 8 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 15:23:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:23:39,257 INFO L93 Difference]: Finished difference Result 4901 states and 7281 transitions. [2024-10-14 15:23:39,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 15:23:39,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 8 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-10-14 15:23:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:23:39,273 INFO L225 Difference]: With dead ends: 4901 [2024-10-14 15:23:39,274 INFO L226 Difference]: Without dead ends: 2735 [2024-10-14 15:23:39,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-14 15:23:39,280 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 667 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-14 15:23:39,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 850 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-14 15:23:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2024-10-14 15:23:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2183. [2024-10-14 15:23:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1611 states have (on average 1.4059590316573556) internal successors, (2265), 1619 states have internal predecessors, (2265), 391 states have call successors, (391), 149 states have call predecessors, (391), 180 states have return successors, (502), 414 states have call predecessors, (502), 390 states have call successors, (502) [2024-10-14 15:23:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3158 transitions. [2024-10-14 15:23:39,461 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3158 transitions. Word has length 109 [2024-10-14 15:23:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:23:39,461 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3158 transitions. [2024-10-14 15:23:39,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 8 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 15:23:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3158 transitions. [2024-10-14 15:23:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 15:23:39,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:23:39,465 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:23:39,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 15:23:39,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:23:39,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:23:39,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1877607444, now seen corresponding path program 1 times [2024-10-14 15:23:39,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:23:39,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026828154] [2024-10-14 15:23:39,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:39,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:23:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:39,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:23:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:39,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:23:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:39,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 15:23:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:39,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 15:23:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:39,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 15:23:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:39,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 15:23:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:40,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 15:23:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:40,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:40,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:40,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:40,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:23:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-14 15:23:40,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:23:40,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026828154] [2024-10-14 15:23:40,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026828154] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:23:40,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347389622] [2024-10-14 15:23:40,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:40,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:23:40,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:23:40,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 15:23:40,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 15:23:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:40,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 15:23:40,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:23:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-14 15:23:40,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 15:23:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-14 15:23:40,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347389622] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 15:23:40,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 15:23:40,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 6] total 16 [2024-10-14 15:23:40,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537704092] [2024-10-14 15:23:40,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:23:40,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 15:23:40,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:23:40,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 15:23:40,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-14 15:23:40,917 INFO L87 Difference]: Start difference. First operand 2183 states and 3158 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 15:23:41,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:23:41,583 INFO L93 Difference]: Finished difference Result 4345 states and 6293 transitions. [2024-10-14 15:23:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 15:23:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2024-10-14 15:23:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:23:41,597 INFO L225 Difference]: With dead ends: 4345 [2024-10-14 15:23:41,597 INFO L226 Difference]: Without dead ends: 2184 [2024-10-14 15:23:41,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-14 15:23:41,606 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 15:23:41,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 735 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 15:23:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2024-10-14 15:23:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2184. [2024-10-14 15:23:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1612 states have (on average 1.4057071960297767) internal successors, (2266), 1620 states have internal predecessors, (2266), 391 states have call successors, (391), 149 states have call predecessors, (391), 180 states have return successors, (502), 414 states have call predecessors, (502), 390 states have call successors, (502) [2024-10-14 15:23:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3159 transitions. [2024-10-14 15:23:41,832 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3159 transitions. Word has length 110 [2024-10-14 15:23:41,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:23:41,833 INFO L471 AbstractCegarLoop]: Abstraction has 2184 states and 3159 transitions. [2024-10-14 15:23:41,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 15:23:41,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3159 transitions. [2024-10-14 15:23:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 15:23:41,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:23:41,837 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:23:41,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 15:23:42,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:23:42,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:23:42,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:23:42,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1354968346, now seen corresponding path program 1 times [2024-10-14 15:23:42,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:23:42,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060196410] [2024-10-14 15:23:42,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:42,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:23:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:23:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:23:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 15:23:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:23:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 15:23:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 15:23:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 15:23:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:23:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-14 15:23:42,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:23:42,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060196410] [2024-10-14 15:23:42,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060196410] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:23:42,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368024813] [2024-10-14 15:23:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:42,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:23:42,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:23:42,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 15:23:42,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 15:23:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:43,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-14 15:23:43,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:23:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 15:23:43,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:23:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368024813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:23:43,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:23:43,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2024-10-14 15:23:43,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646024840] [2024-10-14 15:23:43,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:23:43,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 15:23:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:23:43,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 15:23:43,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2024-10-14 15:23:43,627 INFO L87 Difference]: Start difference. First operand 2184 states and 3159 transitions. Second operand has 15 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 15:23:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:23:48,807 INFO L93 Difference]: Finished difference Result 4665 states and 6824 transitions. [2024-10-14 15:23:48,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 15:23:48,808 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2024-10-14 15:23:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:23:48,823 INFO L225 Difference]: With dead ends: 4665 [2024-10-14 15:23:48,823 INFO L226 Difference]: Without dead ends: 2506 [2024-10-14 15:23:48,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2024-10-14 15:23:48,831 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 35 mSDsluCounter, 4997 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5420 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-14 15:23:48,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5420 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-14 15:23:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2024-10-14 15:23:49,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2228. [2024-10-14 15:23:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1644 states have (on average 1.397810218978102) internal successors, (2298), 1648 states have internal predecessors, (2298), 395 states have call successors, (395), 149 states have call predecessors, (395), 188 states have return successors, (526), 430 states have call predecessors, (526), 394 states have call successors, (526) [2024-10-14 15:23:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 3219 transitions. [2024-10-14 15:23:49,064 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 3219 transitions. Word has length 111 [2024-10-14 15:23:49,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:23:49,065 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 3219 transitions. [2024-10-14 15:23:49,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 15:23:49,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 3219 transitions. [2024-10-14 15:23:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 15:23:49,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:23:49,069 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:23:49,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 15:23:49,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 15:23:49,273 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:23:49,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:23:49,273 INFO L85 PathProgramCache]: Analyzing trace with hash 542848947, now seen corresponding path program 1 times [2024-10-14 15:23:49,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:23:49,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79726797] [2024-10-14 15:23:49,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:23:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:23:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:23:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 15:23:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:23:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 15:23:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 15:23:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 15:23:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 15:23:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 15:23:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:23:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-14 15:23:49,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:23:49,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79726797] [2024-10-14 15:23:49,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79726797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:23:49,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:23:49,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 15:23:49,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948465632] [2024-10-14 15:23:49,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:23:49,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 15:23:49,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:23:49,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 15:23:49,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 15:23:49,641 INFO L87 Difference]: Start difference. First operand 2228 states and 3219 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 8 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 15:23:53,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:23:53,936 INFO L93 Difference]: Finished difference Result 5001 states and 7458 transitions. [2024-10-14 15:23:53,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 15:23:53,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 8 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-14 15:23:53,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:23:53,953 INFO L225 Difference]: With dead ends: 5001 [2024-10-14 15:23:53,954 INFO L226 Difference]: Without dead ends: 2798 [2024-10-14 15:23:53,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-14 15:23:53,961 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 664 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-14 15:23:53,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 718 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-14 15:23:53,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2024-10-14 15:23:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2240. [2024-10-14 15:23:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 1656 states have (on average 1.394927536231884) internal successors, (2310), 1660 states have internal predecessors, (2310), 395 states have call successors, (395), 149 states have call predecessors, (395), 188 states have return successors, (526), 430 states have call predecessors, (526), 394 states have call successors, (526) [2024-10-14 15:23:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3231 transitions. [2024-10-14 15:23:54,206 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 3231 transitions. Word has length 129 [2024-10-14 15:23:54,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:23:54,207 INFO L471 AbstractCegarLoop]: Abstraction has 2240 states and 3231 transitions. [2024-10-14 15:23:54,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 8 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 15:23:54,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3231 transitions. [2024-10-14 15:23:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 15:23:54,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:23:54,212 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:23:54,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 15:23:54,212 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:23:54,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:23:54,213 INFO L85 PathProgramCache]: Analyzing trace with hash 986749621, now seen corresponding path program 1 times [2024-10-14 15:23:54,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:23:54,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550591968] [2024-10-14 15:23:54,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:54,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:23:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:23:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:23:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 15:23:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:23:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 15:23:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 15:23:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 15:23:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 15:23:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 15:23:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:23:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:23:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:23:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-14 15:23:54,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:23:54,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550591968] [2024-10-14 15:23:54,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550591968] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:23:54,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002808796] [2024-10-14 15:23:54,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:23:54,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:23:54,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:23:54,873 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 15:23:54,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 15:23:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:23:55,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 1182 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-14 15:23:55,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:23:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-14 15:23:55,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:23:55,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002808796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:23:55,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:23:55,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2024-10-14 15:23:55,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978156734] [2024-10-14 15:23:55,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:23:55,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 15:23:55,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:23:55,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 15:23:55,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2024-10-14 15:23:55,844 INFO L87 Difference]: Start difference. First operand 2240 states and 3231 transitions. Second operand has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 15:24:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:24:01,345 INFO L93 Difference]: Finished difference Result 4733 states and 6892 transitions. [2024-10-14 15:24:01,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 15:24:01,345 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) Word has length 129 [2024-10-14 15:24:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:24:01,362 INFO L225 Difference]: With dead ends: 4733 [2024-10-14 15:24:01,362 INFO L226 Difference]: Without dead ends: 2518 [2024-10-14 15:24:01,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2024-10-14 15:24:01,428 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 31 mSDsluCounter, 4794 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 5199 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-14 15:24:01,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 5199 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-14 15:24:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2024-10-14 15:24:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2256. [2024-10-14 15:24:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 1672 states have (on average 1.3911483253588517) internal successors, (2326), 1668 states have internal predecessors, (2326), 395 states have call successors, (395), 149 states have call predecessors, (395), 188 states have return successors, (526), 438 states have call predecessors, (526), 394 states have call successors, (526) [2024-10-14 15:24:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3247 transitions. [2024-10-14 15:24:01,620 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3247 transitions. Word has length 129 [2024-10-14 15:24:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:24:01,621 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3247 transitions. [2024-10-14 15:24:01,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 15:24:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3247 transitions. [2024-10-14 15:24:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 15:24:01,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:24:01,626 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:24:01,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 15:24:01,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:24:01,831 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:24:01,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:24:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2127972405, now seen corresponding path program 1 times [2024-10-14 15:24:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:24:01,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247734443] [2024-10-14 15:24:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:24:01,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:24:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:24:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:24:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:24:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 15:24:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:24:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 15:24:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 15:24:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 15:24:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 15:24:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:24:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 15:24:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:24:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:24:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:24:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:24:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 15:24:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 15:24:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 15:24:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 15:24:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:24:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-14 15:24:02,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:24:02,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247734443] [2024-10-14 15:24:02,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247734443] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:24:02,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740978321] [2024-10-14 15:24:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:24:02,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:24:02,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:24:02,502 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 15:24:02,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 15:24:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:24:03,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 15:24:03,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:24:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-14 15:24:03,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 15:24:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-14 15:24:03,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740978321] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 15:24:03,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 15:24:03,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2024-10-14 15:24:03,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387260692] [2024-10-14 15:24:03,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 15:24:03,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 15:24:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:24:03,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 15:24:03,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-10-14 15:24:03,398 INFO L87 Difference]: Start difference. First operand 2256 states and 3247 transitions. Second operand has 17 states, 14 states have (on average 10.928571428571429) internal successors, (153), 10 states have internal predecessors, (153), 2 states have call successors, (54), 9 states have call predecessors, (54), 5 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38)